{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/clustering/papers/85","list_of":"/task/clustering","task":"Clustering","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":85,"pages_in_order":108,"rows_per_page":100,"rows":[8401,8500],"of":10718,"counts":{"archive_papers_tagged":10718,"with_a_code_link":2823,"where_syntology_ran_a_sample":419,"not_listed_spam_title":0,"listed":10718,"listed_where_code_ran":419,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":335,"every_run_a_failure_of_syntologys_instrument":84,"listed_with_a_run_with_no_instrument_failure":335,"listed_every_run_a_failure_of_syntologys_instrument":84,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/clustering","prev":"/task/clustering/papers/84","next":"/task/clustering/papers/86","papers":[{"url":null,"slug":"fuzzy-based-dialectical-non-supervised-image","title":"Fuzzy-Based Dialectical Non-Supervised Image Classification and Clustering","date":"2017-12-03","arxiv_id":"1712.01694","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-clustering-through-semidefinite","title":"Adaptive Clustering through Semidefinite Programming","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"alibaba-at-ijcnlp-2017-task-2-a-boosted-deep","title":"Alibaba at IJCNLP-2017 Task 2: A Boosted Deep System for Dimensional Sentiment Analysis of Chinese Phrases","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"approximation-bounds-for-hierarchical","title":"Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-billions-of-reads-for-dna-data","title":"Clustering Billions of Reads for DNA Data Storage","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-stable-instances-of-euclidean-k","title":"Clustering Stable Instances of Euclidean k-means.","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-optimization-for-linear-dynamical","title":"Efficient Optimization for Linear Dynamical Systems with Applications to Clustering and Sparse Coding","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-bayesian-image-analysis-from-low","title":"Hierarchical Bayesian image analysis: from low-level modeling to robust supervised learning","date":"2017-12-01","arxiv_id":"1712.00368","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-clustering-beyond-the-worst-case","title":"Hierarchical Clustering Beyond the Worst-Case","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-a-structured-optimal-bipartite-graph","title":"Learning A Structured Optimal Bipartite Graph for Co-Clustering","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ncyu-at-ijcnlp-2017-task-2-dimensional","title":"NCYU at IJCNLP-2017 Task 2: Dimensional Sentiment Analysis for Chinese Phrases using Vector Representations","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semisupervised-clustering-and-queries-and","title":"Semisupervised Clustering, AND-Queries and Locally Encodable Source Coding","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-embedded-k-means-clustering","title":"Sparse Embedded k-Means Clustering","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"subject-selection-on-a-riemannian-manifold","title":"Subject Selection on a Riemannian Manifold for Unsupervised Cross-subject Seizure Detection","date":"2017-12-01","arxiv_id":"1712.00465","repositories_listed":0,"syntology":null},{"url":null,"slug":"subspace-clustering-via-tangent-cones","title":"Subspace Clustering via Tangent Cones","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"provably-noise-robust-regularised-k-means","title":"Provably noise-robust, regularised $k$-means clustering","date":"2017-11-30","arxiv_id":"1711.11247","repositories_listed":0,"syntology":null},{"url":null,"slug":"hsc-a-novel-method-for-clustering-hierarchies","title":"HSC: A Novel Method for Clustering Hierarchies of Networked Data","date":"2017-11-29","arxiv_id":"1711.11071","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-and-active-few-shot-learning","title":"Semi-Supervised and Active Few-Shot Learning with Prototypical Networks","date":"2017-11-29","arxiv_id":"1711.10856","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-block-point-process-model-for-continuous","title":"The Block Point Process Model for Continuous-Time Event-Based Dynamic Networks","date":"2017-11-29","arxiv_id":"1711.10967","repositories_listed":0,"syntology":null},{"url":null,"slug":"3d-a-nets-3d-deep-dense-descriptor-for","title":"3D-A-Nets: 3D Deep Dense Descriptor for Volumetric Shapes with Adversarial Networks","date":"2017-11-28","arxiv_id":"1711.10108","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-fatal-point-concept-and-a-low-sensitivity","title":"A fatal point concept and a low-sensitivity quantitative measure for traffic safety analytics","date":"2017-11-28","arxiv_id":"1711.10131","repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-of-entities-via-their","title":"Classification of entities via their descriptive sentences","date":"2017-11-28","arxiv_id":"1711.10317","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-lesion-graphs-in-the-wild-relationship","title":"Deep Lesion Graphs in the Wild: Relationship Learning and Organization of Significant Radiology Image Findings in a Diverse Large-scale Lesion Database","date":"2017-11-28","arxiv_id":"1711.10535","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-shot-coresets-the-case-of-k-clustering","title":"One-Shot Coresets: The Case of k-Clustering","date":"2017-11-27","arxiv_id":"1711.09649","repositories_listed":0,"syntology":null},{"url":null,"slug":"pedagogical-learning","title":"Pedagogical learning","date":"2017-11-26","arxiv_id":"1711.09401","repositories_listed":0,"syntology":null},{"url":null,"slug":"whale-optimization-based-energy-efficient","title":"Whale Optimization Based Energy-Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks","date":"2017-11-26","arxiv_id":"1711.09389","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-semi-random-mixtures-of-gaussians","title":"Clustering Semi-Random Mixtures of Gaussians","date":"2017-11-23","arxiv_id":"1711.08841","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-clustering-of-contextual-cascading","title":"Online Clustering of Contextual Cascading Bandits","date":"2017-11-23","arxiv_id":"1711.08594","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-correlational-analysis-of-multiagent","title":"A correlational analysis of multiagent sensorimotor interactions: clustering autonomous and controllable entities","date":"2017-11-22","arxiv_id":"1711.08333","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-bayesian-inference-for-a-scale","title":"Variational Bayesian Inference For A Scale Mixture Of Normal Distributions Handling Missing Data","date":"2017-11-22","arxiv_id":"1711.08374","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-implementation-of-a-recognition","title":"Efficient Implementation of a Recognition System Using the Cortex Ventral Stream Model","date":"2017-11-21","arxiv_id":"1711.07827","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-em-tau-algorithm-a-new-em-style","title":"On the EM-Tau algorithm: a new EM-style algorithm with partial E-steps","date":"2017-11-21","arxiv_id":"1711.07814","repositories_listed":0,"syntology":null},{"url":null,"slug":"better-agnostic-clustering-via-relaxed-tensor","title":"Better Agnostic Clustering Via Relaxed Tensor Norms","date":"2017-11-20","arxiv_id":"1711.07465","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-approximately-orthogonal-nonnegative","title":"Deep Approximately Orthogonal Nonnegative Matrix Factorization for Clustering","date":"2017-11-20","arxiv_id":"1711.07437","repositories_listed":0,"syntology":null},{"url":null,"slug":"glitch-classification-and-clustering-for-ligo","title":"Glitch Classification and Clustering for LIGO with Deep Transfer Learning","date":"2017-11-20","arxiv_id":"1711.07468","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-complexity-relaxed-word-mover-s","title":"Linear-Complexity Relaxed Word Mover's Distance with GPU Acceleration","date":"2017-11-20","arxiv_id":"1711.07227","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-exchangeable-random-partition-models-for","title":"Non-exchangeable random partition models for microclustering","date":"2017-11-20","arxiv_id":"1711.07287","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-convergence-of-epanechnikov-mean-shift","title":"On Convergence of Epanechnikov Mean Shift","date":"2017-11-20","arxiv_id":"1711.07441","repositories_listed":0,"syntology":null},{"url":null,"slug":"subgroup-identification-and-interpretation","title":"Subgroup Identification and Interpretation with Bayesian Nonparametric Models in Health Care Claims Data","date":"2017-11-20","arxiv_id":"1711.07527","repositories_listed":0,"syntology":null},{"url":null,"slug":"zero-shot-learning-via-shared-reconstruction","title":"Zero-shot Learning via Shared-Reconstruction-Graph Pursuit","date":"2017-11-20","arxiv_id":"1711.07302","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-signal-processing-approach-for-real","title":"A Graph Signal Processing Approach For Real-Time Traffic Prediction In Transportation Networks","date":"2017-11-19","arxiv_id":"1711.06954","repositories_listed":0,"syntology":null},{"url":null,"slug":"advise-symbolism-and-external-knowledge-for","title":"ADVISE: Symbolism and External Knowledge for Decoding Advertisements","date":"2017-11-17","arxiv_id":"1711.06666","repositories_listed":0,"syntology":null},{"url":null,"slug":"hardening-quantum-machine-learning-against","title":"Hardening Quantum Machine Learning Against Adversaries","date":"2017-11-17","arxiv_id":"1711.06652","repositories_listed":0,"syntology":null},{"url":null,"slug":"superpixels-based-segmentation-and-svm-based","title":"Superpixels Based Segmentation and SVM Based Classification Method to Distinguish Five Diseases from Normal Regions in Wireless Capsule Endoscopy","date":"2017-11-17","arxiv_id":"1711.06616","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-reliable-inference-algorithm-for","title":"Fast and reliable inference algorithm for hierarchical stochastic block models","date":"2017-11-14","arxiv_id":"1711.05150","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-non-processive-molecular-motor","title":"Analysis of non-processive molecular motor transport using renewal reward theory","date":"2017-11-13","arxiv_id":"1711.04852","repositories_listed":0,"syntology":null},{"url":null,"slug":"visual-concepts-and-compositional-voting","title":"Visual Concepts and Compositional Voting","date":"2017-11-13","arxiv_id":"1711.04451","repositories_listed":0,"syntology":null},{"url":null,"slug":"parameter-estimation-in-finite-mixture-models","title":"A unified framework for hard and soft clustering with regularized optimal transport","date":"2017-11-12","arxiv_id":"1711.04366","repositories_listed":0,"syntology":null},{"url":null,"slug":"cur-decompositions-similarity-matrices-and","title":"CUR Decompositions, Similarity Matrices, and Subspace Clustering","date":"2017-11-11","arxiv_id":"1711.04178","repositories_listed":0,"syntology":null},{"url":null,"slug":"differential-performance-debugging-with","title":"Differential Performance Debugging with Discriminant Regression Trees","date":"2017-11-11","arxiv_id":"1711.04076","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-clustering-scale-sublinearly-with-its","title":"Can clustering scale sublinearly with its clusters? A variational EM acceleration of GMMs and $k$-means","date":"2017-11-09","arxiv_id":"1711.03431","repositories_listed":0,"syntology":null},{"url":null,"slug":"cogscik-clustering-for-cognitive-science","title":"CogSciK: Clustering for Cognitive Science Motivated Decision Making","date":"2017-11-09","arxiv_id":"1711.03237","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-with-feature-selection-using","title":"Clustering with feature selection using alternating minimization, Application to computational biology","date":"2017-11-08","arxiv_id":"1711.02974","repositories_listed":0,"syntology":null},{"url":null,"slug":"recursive-neural-networks-in-quarkgluon","title":"Recursive Neural Networks in Quark/Gluon Tagging","date":"2017-11-07","arxiv_id":"1711.02633","repositories_listed":0,"syntology":null},{"url":null,"slug":"marginalized-graph-autoencoder-for-graph","title":"Marginalized graph autoencoder for graph clustering","date":"2017-11-06","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"memory-efficient-kernel-pca-via-partial","title":"Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA","date":"2017-11-06","arxiv_id":"1711.01742","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-deep-learning-for-community-discovery","title":"Using deep learning for community discovery in social networks","date":"2017-11-06","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-preserving-k-anonymity","title":"Distribution-Preserving k-Anonymity","date":"2017-11-05","arxiv_id":"1711.01514","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-submodular-maximization-the-case","title":"Stochastic Submodular Maximization: The Case of Coverage Functions","date":"2017-11-05","arxiv_id":"1711.01566","repositories_listed":0,"syntology":null},{"url":null,"slug":"ocasta-clustering-configuration-settings-for","title":"Ocasta: Clustering Configuration Settings For Error Recovery","date":"2017-11-02","arxiv_id":"1711.04030","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-parallel-recurrent-neural-network-for","title":"A Parallel Recurrent Neural Network for Language Modeling with POS Tags","date":"2017-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-ensemble-method-with-sentiment-features","title":"An Ensemble Method with Sentiment Features and Clustering Support","date":"2017-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/data-driven-computing-with-noisy-material","slug":"data-driven-computing-with-noisy-material","title":"Data Driven Computing with Noisy Material Data Sets","date":"2017-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"detection-for-5g-noma-an-online-adaptive","title":"Detection for 5G-NOMA: An Online Adaptive Machine Learning Approach","date":"2017-11-01","arxiv_id":"1711.00355","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-modeling-sense-relatedness-in-multi","title":"On Modeling Sense Relatedness in Multi-prototype Word Embedding","date":"2017-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerated-sparse-subspace-clustering","title":"Accelerated Sparse Subspace Clustering","date":"2017-10-31","arxiv_id":"1711.00126","repositories_listed":0,"syntology":null},{"url":null,"slug":"fuzzy-clustering-using-linguistic-valued","title":"Fuzzy clustering using linguistic-valued exponent","date":"2017-10-30","arxiv_id":"1711.01149","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-convergent-algorithm-for-bi-orthogonal","title":"A Convergent Algorithm for Bi-orthogonal Nonnegative Matrix Tri-Factorization","date":"2017-10-29","arxiv_id":"1710.11478","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-approach-using-ontology-similarity","title":"A Hybrid Approach using Ontology Similarity and Fuzzy Logic for Semantic Question Answering","date":"2017-10-29","arxiv_id":"1709.09214","repositories_listed":0,"syntology":null},{"url":null,"slug":"complexity-analysis-approach-for","title":"Complexity Analysis Approach for Prefabricated Construction Products Using Uncertain Data Clustering","date":"2017-10-29","arxiv_id":"1710.10555","repositories_listed":0,"syntology":null},{"url":null,"slug":"dimensionality-reduction-methods-for","title":"Dimensionality reduction methods for molecular simulations","date":"2017-10-29","arxiv_id":"1710.10629","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-dominant-user-utterances-and-system","title":"Finding Dominant User Utterances And System Responses in Conversations","date":"2017-10-29","arxiv_id":"1710.10609","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-consistency-of-quick-shift","title":"On the Consistency of Quick Shift","date":"2017-10-29","arxiv_id":"1710.10646","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-tumor-segmentation-and-brain","title":"Automated Tumor Segmentation and Brain Mapping for the Tumor Area","date":"2017-10-28","arxiv_id":"1710.11121","repositories_listed":0,"syntology":null},{"url":null,"slug":"crime-incidents-embedding-using-restricted","title":"Crime incidents embedding using restricted Boltzmann machines","date":"2017-10-28","arxiv_id":"1710.10513","repositories_listed":0,"syntology":null},{"url":null,"slug":"partitioning-relational-matrices-of","title":"Partitioning Relational Matrices of Similarities or Dissimilarities using the Value of Information","date":"2017-10-28","arxiv_id":"1710.10381","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-k-groups-via-hartigans-method","title":"Kernel k-Groups via Hartigan's Method","date":"2017-10-26","arxiv_id":"1710.09859","repositories_listed":0,"syntology":null},{"url":null,"slug":"categorizing-user-sessions-at-pinterest","title":"Categorizing User Sessions at Pinterest","date":"2017-10-25","arxiv_id":"1703.09662","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-backward-euler-an-implicit","title":"Stochastic Backward Euler: An Implicit Gradient Descent Algorithm for $k$-means Clustering","date":"2017-10-21","arxiv_id":"1710.07746","repositories_listed":0,"syntology":null},{"url":null,"slug":"superpixel-based-segmentation-and","title":"Superpixel Based Segmentation and Classification of Polyps in Wireless Capsule Endoscopy","date":"2017-10-20","arxiv_id":"1710.07390","repositories_listed":0,"syntology":null},{"url":null,"slug":"frequency-based-index-estimating-the","title":"Frequency Based Index Estimating the Subclusters' Connection Strength","date":"2017-10-19","arxiv_id":"1710.07340","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-pet-scan-tumor-segmentation-using","title":"Fast PET Scan Tumor Segmentation using Superpixels, Principal Component Analysis and K-means Clustering","date":"2017-10-18","arxiv_id":"1710.08798","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-lidar-space-clustering-and","title":"Combining LiDAR Space Clustering and Convolutional Neural Networks for Pedestrian Detection","date":"2017-10-17","arxiv_id":"1710.06160","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-general-framework-for-robust-interactive","title":"A General Framework for Robust Interactive Learning","date":"2017-10-16","arxiv_id":"1710.05422","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-simple-better-revisiting-non-linear-matrix","title":"Is Simple Better? Revisiting Non-linear Matrix Factorization for Learning Incomplete Ratings","date":"2017-10-16","arxiv_id":"1710.05613","repositories_listed":0,"syntology":null},{"url":null,"slug":"volumetric-data-exploration-with-machine","title":"Volumetric Data Exploration with Machine Learning-Aided Visualization in Neutron Science","date":"2017-10-16","arxiv_id":"1710.05994","repositories_listed":0,"syntology":null},{"url":null,"slug":"k-means-clustering-for-efficient-and-robust","title":"K-means clustering for efficient and robust registration of multi-view point sets","date":"2017-10-14","arxiv_id":"1710.05193","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-scalable-spectral-clustering-via","title":"Towards Scalable Spectral Clustering via Spectrum-Preserving Sparsification","date":"2017-10-12","arxiv_id":"1710.04584","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-kernel-k-means-for-large-scale","title":"Distributed Kernel K-Means for Large Scale Clustering","date":"2017-10-09","arxiv_id":"1710.03013","repositories_listed":0,"syntology":null},{"url":null,"slug":"driving-behavior-analysis-through-can-bus","title":"Driving Behavior Analysis through CAN Bus Data in an Uncontrolled Environment","date":"2017-10-09","arxiv_id":"1710.04133","repositories_listed":0,"syntology":null},{"url":null,"slug":"function-space-analysis-of-deep-learning","title":"Function space analysis of deep learning representation layers","date":"2017-10-09","arxiv_id":"1710.03263","repositories_listed":0,"syntology":null},{"url":null,"slug":"discovering-playing-patterns-time-series","title":"Discovering Playing Patterns: Time Series Clustering of Free-To-Play Game Data","date":"2017-10-06","arxiv_id":"1710.02268","repositories_listed":0,"syntology":null},{"url":null,"slug":"plane-extraction-from-depth-data-using-a","title":"Plane-extraction from depth-data using a Gaussian mixture regression model","date":"2017-10-05","arxiv_id":"1710.01925","repositories_listed":0,"syntology":null},{"url":null,"slug":"reliable-clustering-of-bernoulli-mixture","title":"Reliable Clustering of Bernoulli Mixture Models","date":"2017-10-05","arxiv_id":"1710.02101","repositories_listed":0,"syntology":null},{"url":null,"slug":"multitask-learning-using-task-clustering-with","title":"Multitask Learning using Task Clustering with Applications to Predictive Modeling and GWAS of Plant Varieties","date":"2017-10-04","arxiv_id":"1710.01788","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-estimation-of-the-percolation","title":"Spectral estimation of the percolation transition in clustered networks","date":"2017-10-04","arxiv_id":"1710.01592","repositories_listed":0,"syntology":null},{"url":null,"slug":"decoding-visemes-improving-machine-lipreading","title":"Decoding visemes: improving machine lipreading","date":"2017-10-03","arxiv_id":"1710.01288","repositories_listed":0,"syntology":null},{"url":null,"slug":"monte-carlo-approximation-certificates-for-k","title":"Monte Carlo approximation certificates for k-means clustering","date":"2017-10-03","arxiv_id":"1710.00956","repositories_listed":0,"syntology":null},{"url":null,"slug":"speaker-independent-machine-lip-reading-with","title":"Speaker-independent machine lip-reading with speaker-dependent viseme classifiers","date":"2017-10-03","arxiv_id":"1710.01122","repositories_listed":0,"syntology":null},{"url":null,"slug":"deepsafe-a-data-driven-approach-for-checking","title":"DeepSafe: A Data-driven Approach for Checking Adversarial Robustness in Neural Networks","date":"2017-10-02","arxiv_id":"1710.00486","repositories_listed":0,"syntology":null}],"record_sha256":"505ce7152eed74acbbc6f6996e7601a4fba3da410e17acb46ea9bf3740975c7a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}