{"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/89","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":89,"pages_in_order":108,"rows_per_page":100,"rows":[8801,8900],"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/88","next":"/task/clustering/papers/90","papers":[{"url":null,"slug":"factoring-ambiguity-out-of-the-prediction-of","title":"Factoring Ambiguity out of the Prediction of Compositionality for German Multi-Word Expressions","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hashtag-sense-clustering-based-on-temporal","title":"Hashtag Sense Clustering Based on Temporal Similarity","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inducing-script-structure-from-crowdsourced","title":"Inducing Script Structure from Crowdsourced Event Descriptions via Semi-Supervised Clustering","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"intoevents-an-interactive-toolkit-for","title":"InToEventS: An Interactive Toolkit for Discovering and Building Event Schemas","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"language-independent-named-entity-analysis","title":"Language-Independent Named Entity Analysis Using Parallel Projection and Rule-Based Disambiguation","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multilingual-metaphor-processing-experiments","title":"Multilingual Metaphor Processing: Experiments with Semi-Supervised and Unsupervised Learning","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-emotional-word-ratings-using","title":"Predicting Emotional Word Ratings using Distributional Representations and Signed Clustering","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"word-embedding-and-topic-modeling-enhanced","title":"Word Embedding and Topic Modeling Enhanced Multiple Features for Content Linking and Argument / Sentiment Labeling in Online Forums","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"word-sense-filtering-improves-embedding-based","title":"Word Sense Filtering Improves Embedding-Based Lexical Substitution","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"novel-framework-for-spectral-clustering-using","title":"Novel Framework for Spectral Clustering using Topological Node Features(TNF)","date":"2017-03-31","arxiv_id":"1703.10756","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-entity-retrieval-on-structured-data","title":"Improving Entity Retrieval on Structured Data","date":"2017-03-30","arxiv_id":"1703.10349","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-informativeness-of-k-means-and","title":"The Informativeness of K -Means for Learning Mixture Models","date":"2017-03-30","arxiv_id":"1703.10534","repositories_listed":0,"syntology":null},{"url":null,"slug":"bundle-optimization-for-multi-aspect","title":"Bundle Optimization for Multi-aspect Embedding","date":"2017-03-29","arxiv_id":"1703.09928","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-and-stochastic-block","title":"Community Detection and Stochastic Block Models","date":"2017-03-29","arxiv_id":"1703.10146","repositories_listed":0,"syntology":null},{"url":null,"slug":"grouped-convolutional-neural-networks-for","title":"Grouped Convolutional Neural Networks for Multivariate Time Series","date":"2017-03-29","arxiv_id":"1703.09938","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-spectral-clustering-using-the","title":"Improving Spectral Clustering using the Asymptotic Value of the Normalised Cut","date":"2017-03-29","arxiv_id":"1703.09975","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-clustering-based-on-content-and","title":"Hybrid Clustering based on Content and Connection Structure using Joint Nonnegative Matrix Factorization","date":"2017-03-28","arxiv_id":"1703.09646","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-and-weakly-supervised-semantic","title":"Semi and Weakly Supervised Semantic Segmentation Using Generative Adversarial Network","date":"2017-03-28","arxiv_id":"1703.09695","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-regularized-tensor-sparse-coding-for","title":"Graph Regularized Tensor Sparse Coding for Image Representation","date":"2017-03-27","arxiv_id":"1703.09342","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiple-instance-learning-with-the-optimal","title":"Multiple Instance Learning with the Optimal Sub-Pattern Assignment Metric","date":"2017-03-27","arxiv_id":"1703.08933","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simulated-annealing-approach-to-optimal","title":"A simulated annealing approach to optimal storing in a multi-level warehouse","date":"2017-03-25","arxiv_id":"1704.01049","repositories_listed":0,"syntology":null},{"url":null,"slug":"morphological-analysis-for-the-maltese","title":"Morphological Analysis for the Maltese Language: The Challenges of a Hybrid System","date":"2017-03-25","arxiv_id":"1703.08701","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-nonconvex-splitting-method-for-symmetric","title":"A Nonconvex Splitting Method for Symmetric Nonnegative Matrix Factorization: Convergence Analysis and Optimality","date":"2017-03-24","arxiv_id":"1703.08267","repositories_listed":0,"syntology":null},{"url":null,"slug":"k-means-clustering-using-tabu-search-with","title":"K-Means Clustering using Tabu Search with Quantized Means","date":"2017-03-24","arxiv_id":"1703.08440","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-for-different-scales-of","title":"Clustering for Different Scales of Measurement - the Gap-Ratio Weighted K-means Algorithm","date":"2017-03-22","arxiv_id":"1703.07625","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-variational-auto-encoders-for","title":"Nonparametric Variational Auto-encoders for Hierarchical Representation Learning","date":"2017-03-21","arxiv_id":"1703.07027","repositories_listed":0,"syntology":null},{"url":null,"slug":"independence-clustering-without-a-matrix","title":"Independence clustering (without a matrix)","date":"2017-03-20","arxiv_id":"1703.06700","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-wake-sleep-algorithm-for-recurrent-spiking","title":"A wake-sleep algorithm for recurrent, spiking neural networks","date":"2017-03-18","arxiv_id":"1703.06290","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-document-clustering-by-eliminating","title":"Improving Document Clustering by Eliminating Unnatural Language","date":"2017-03-16","arxiv_id":"1703.05706","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-this-word-borrowed-an-automatic-approach","title":"Is this word borrowed? An automatic approach to quantify the likeliness of borrowing in social media","date":"2017-03-15","arxiv_id":"1703.05122","repositories_listed":0,"syntology":null},{"url":null,"slug":"matched-bipartite-block-model-with-covariates","title":"Matched bipartite block model with covariates","date":"2017-03-15","arxiv_id":"1703.04943","repositories_listed":0,"syntology":null},{"url":null,"slug":"transfer-learning-by-asymmetric-image","title":"Transfer Learning by Asymmetric Image Weighting for Segmentation across Scanners","date":"2017-03-15","arxiv_id":"1703.04981","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-proximity-aware-hierarchical-clustering-of","title":"A Proximity-Aware Hierarchical Clustering of Faces","date":"2017-03-14","arxiv_id":"1703.04835","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-random-finite-set-model-for-data-clustering","title":"A Random Finite Set Model for Data Clustering","date":"2017-03-14","arxiv_id":"1703.04832","repositories_listed":0,"syntology":null},{"url":null,"slug":"subspace-learning-in-the-presence-of-sparse","title":"Subspace Learning in The Presence of Sparse Structured Outliers and Noise","date":"2017-03-14","arxiv_id":"1703.04611","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-skin-lesion-segmentation-using-semi","title":"Automatic Skin Lesion Segmentation using Semi-supervised Learning Technique","date":"2017-03-13","arxiv_id":"1703.04301","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-3d-object-detection-and-pose-estimation","title":"A 3D Object Detection and Pose Estimation Pipeline Using RGB-D Images","date":"2017-03-11","arxiv_id":"1703.03940","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-best-k-analogies-from-data","title":"Learning best K analogies from data distribution for case-based software effort estimation","date":"2017-03-11","arxiv_id":"1703.04567","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-sparsity-for-efficient-submodular","title":"Leveraging Sparsity for Efficient Submodular Data Summarization","date":"2017-03-08","arxiv_id":"1703.02690","repositories_listed":0,"syntology":null},{"url":null,"slug":"memory-enriched-big-bang-big-crunch","title":"Memory Enriched Big Bang Big Crunch Optimization Algorithm for Data Clustering","date":"2017-03-08","arxiv_id":"1703.02883","repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-bounds-for-graphical-record","title":"Performance Bounds for Graphical Record Linkage","date":"2017-03-08","arxiv_id":"1703.02679","repositories_listed":0,"syntology":null},{"url":null,"slug":"horde-of-bandits-using-gaussian-markov-random","title":"Horde of Bandits using Gaussian Markov Random Fields","date":"2017-03-07","arxiv_id":"1703.02626","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-based-multiple-instance-learning","title":"Model-Based Multiple Instance Learning","date":"2017-03-07","arxiv_id":"1703.02155","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-time-series-distance-measure-for-efficient","title":"A time series distance measure for efficient clustering of input output signals by their underlying dynamics","date":"2017-03-06","arxiv_id":"1703.01923","repositories_listed":0,"syntology":null},{"url":null,"slug":"all-the-people-around-me-face-discovery-in","title":"All the people around me: face discovery in egocentric photo-streams","date":"2017-03-06","arxiv_id":"1703.01790","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-optimal-hierarchical-clustering-approach","title":"An optimal hierarchical clustering approach to segmentation of mobile LiDAR point clouds","date":"2017-03-06","arxiv_id":"1703.02150","repositories_listed":0,"syntology":null},{"url":null,"slug":"viewpoint-selection-for-photographing","title":"Viewpoint Selection for Photographing Architectures","date":"2017-03-06","arxiv_id":"1703.01702","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-friendly-set-version-of","title":"Machine Learning Friendly Set Version of Johnson-Lindenstrauss Lemma","date":"2017-03-04","arxiv_id":"1703.01507","repositories_listed":0,"syntology":null},{"url":null,"slug":"co-clustering-for-multitask-learning","title":"Co-Clustering for Multitask Learning","date":"2017-03-03","arxiv_id":"1703.00994","repositories_listed":0,"syntology":null},{"url":null,"slug":"outlier-cluster-formation-in-spectral","title":"Outlier Cluster Formation in Spectral Clustering","date":"2017-03-03","arxiv_id":"1703.01028","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-communication-optimal-distributed","title":"Robust Communication-Optimal Distributed Clustering Algorithms","date":"2017-03-02","arxiv_id":"1703.00830","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-review-of-two-decades-of-correlations","title":"A review of two decades of correlations, hierarchies, networks and clustering in financial markets","date":"2017-03-01","arxiv_id":"1703.00485","repositories_listed":0,"syntology":null},{"url":null,"slug":"phylogenetic-tools-in-astrophysics","title":"Phylogenetic Tools in Astrophysics","date":"2017-03-01","arxiv_id":"1703.00286","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-analytical-approximations-to-statistical","title":"Semi-analytical approximations to statistical moments of sigmoid and softmax mappings of normal variables","date":"2017-03-01","arxiv_id":"1703.00091","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-description-length-approach-to-determining","title":"A description length approach to determining the number of k-means clusters","date":"2017-02-28","arxiv_id":"1703.00039","repositories_listed":0,"syntology":null},{"url":null,"slug":"auto-clustering-output-layer-automatic","title":"Auto-clustering Output Layer: Automatic Learning of Latent Annotations in Neural Networks","date":"2017-02-28","arxiv_id":"1702.08648","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-sensor-data-pattern-recognition-for","title":"Multi-Sensor Data Pattern Recognition for Multi-Target Localization: A Machine Learning Approach","date":"2017-02-28","arxiv_id":"1703.00084","repositories_listed":0,"syntology":null},{"url":null,"slug":"parallel-structure-from-motion-from-local","title":"Parallel Structure from Motion from Local Increment to Global Averaging","date":"2017-02-28","arxiv_id":"1702.08601","repositories_listed":0,"syntology":null},{"url":null,"slug":"super-trajectory-for-video-segmentation","title":"Super-Trajectory for Video Segmentation","date":"2017-02-28","arxiv_id":"1702.08634","repositories_listed":0,"syntology":null},{"url":null,"slug":"multimodal-clustering-for-community-detection","title":"Multimodal Clustering for Community Detection","date":"2017-02-27","arxiv_id":"1702.08557","repositories_listed":0,"syntology":null},{"url":null,"slug":"mutual-information-based-labelling-and","title":"Mutual Information based labelling and comparing clusters","date":"2017-02-27","arxiv_id":"1702.08199","repositories_listed":0,"syntology":null},{"url":null,"slug":"uniform-deviation-bounds-for-unbounded-loss","title":"Uniform Deviation Bounds for Unbounded Loss Functions like k-Means","date":"2017-02-27","arxiv_id":"1702.08249","repositories_listed":0,"syntology":null},{"url":null,"slug":"consistent-alignment-of-word-embedding-models","title":"Consistent Alignment of Word Embedding Models","date":"2017-02-24","arxiv_id":"1702.07680","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-intraday-financial-market-states","title":"Detecting intraday financial market states using temporal clustering","date":"2017-02-24","arxiv_id":"1508.04900","repositories_listed":0,"syntology":null},{"url":null,"slug":"analyzing-learned-convnet-features-with","title":"Analyzing Learned Convnet Features with Dirichlet Process Gaussian Mixture Models","date":"2017-02-23","arxiv_id":"1702.07189","repositories_listed":0,"syntology":null},{"url":null,"slug":"k-means-clustering-and-ensemble-of","title":"k-Means Clustering and Ensemble of Regressions: An Algorithm for the ISIC 2017 Skin Lesion Segmentation Challenge","date":"2017-02-23","arxiv_id":"1702.07333","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-decision-trees","title":"Neural Decision Trees","date":"2017-02-23","arxiv_id":"1702.07360","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-clustering-using-pckid-a","title":"Spectral Clustering using PCKID - A Probabilistic Cluster Kernel for Incomplete Data","date":"2017-02-23","arxiv_id":"1702.07190","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-learning-of-morphological","title":"Unsupervised Learning of Morphological Forests","date":"2017-02-22","arxiv_id":"1702.07015","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-consistency-of-k-means-algorithm","title":"On the Consistency of $k$-means++ algorithm","date":"2017-02-20","arxiv_id":"1702.06120","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-graph-construction-for-fast-image","title":"Revisiting Graph Construction for Fast Image Segmentation","date":"2017-02-18","arxiv_id":"1702.05650","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-unified-taxonomy-of-biclustering","title":"Towards a Unified Taxonomy of Biclustering Methods","date":"2017-02-17","arxiv_id":"1702.05376","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-unsupervised-methods-for","title":"Fast and unsupervised methods for multilingual cognate clustering","date":"2017-02-16","arxiv_id":"1702.04938","repositories_listed":0,"syntology":null},{"url":null,"slug":"fmri-clustering-and-false-positive-rates","title":"FMRI Clustering and False Positive Rates","date":"2017-02-16","arxiv_id":"1702.04846","repositories_listed":0,"syntology":null},{"url":null,"slug":"fmri-clustering-in-afni-false-positive-rates","title":"FMRI Clustering in AFNI: False Positive Rates Redux","date":"2017-02-16","arxiv_id":"1702.04845","repositories_listed":0,"syntology":null},{"url":null,"slug":"reflexive-regular-equivalence-for-bipartite","title":"Reflexive Regular Equivalence for Bipartite Data","date":"2017-02-16","arxiv_id":"1702.04956","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-learning-for-discrete-choice","title":"Semi-supervised Learning for Discrete Choice Models","date":"2017-02-16","arxiv_id":"1702.05137","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-discrepancy-between-kleinbergs","title":"On the Discrepancy Between Kleinberg's Clustering Axioms and $k$-Means Clustering Algorithm Behavior","date":"2017-02-15","arxiv_id":"1702.04577","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-seeking-consensus-between-document","title":"On Seeking Consensus Between Document Similarity Measures","date":"2017-02-13","arxiv_id":"1702.03724","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-consistency-of-compressive-spectral","title":"On Consistency of Compressive Spectral Clustering","date":"2017-02-12","arxiv_id":"1702.03522","repositories_listed":0,"syntology":null},{"url":null,"slug":"similarity-preserving-representation-learning","title":"Similarity Preserving Representation Learning for Time Series Clustering","date":"2017-02-12","arxiv_id":"1702.03584","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-clustering-approach-to-heterogeneous-change","title":"A clustering approach to heterogeneous change detection","date":"2017-02-10","arxiv_id":"1702.03176","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-mixture-of-networks","title":"Generative Mixture of Networks","date":"2017-02-10","arxiv_id":"1702.03307","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-for-point-pattern-data","title":"Clustering For Point Pattern Data","date":"2017-02-08","arxiv_id":"1702.02262","repositories_listed":0,"syntology":null},{"url":null,"slug":"rapid-parametric-density-estimation","title":"Rapid parametric density estimation","date":"2017-02-07","arxiv_id":"1702.02144","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-clustering-for-time-series-using","title":"Robust Clustering for Time Series Using Spectral Densities and Functional Data Analysis","date":"2017-02-07","arxiv_id":"1702.02165","repositories_listed":0,"syntology":null},{"url":null,"slug":"prepositions-in-context","title":"Prepositions in Context","date":"2017-02-05","arxiv_id":"1702.01466","repositories_listed":0,"syntology":null},{"url":null,"slug":"shape-based-approach-to-household-load-curve","title":"Shape-Based Approach to Household Load Curve Clustering and Prediction","date":"2017-02-05","arxiv_id":"1702.01414","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-image-geo-localization-using","title":"Large-scale Image Geo-Localization Using Dominant Sets","date":"2017-02-04","arxiv_id":"1702.01238","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-unsupervised-weed-scouting-for","title":"Towards Unsupervised Weed Scouting for Agricultural Robotics","date":"2017-02-04","arxiv_id":"1702.01247","repositories_listed":0,"syntology":null},{"url":null,"slug":"fuzzy-clustering-data-given-on-the-ordinal","title":"Fuzzy Clustering Data Given on the Ordinal Scale Based on Membership and Likelihood Functions Sharing","date":"2017-02-03","arxiv_id":"1702.01200","repositories_listed":0,"syntology":null},{"url":null,"slug":"ku-ispl-speaker-recognition-systems-under","title":"KU-ISPL Speaker Recognition Systems under Language mismatch condition for NIST 2016 Speaker Recognition Evaluation","date":"2017-02-03","arxiv_id":"1702.00956","repositories_listed":0,"syntology":null},{"url":null,"slug":"procedural-content-generation-via-machine","title":"Procedural Content Generation via Machine Learning (PCGML)","date":"2017-02-02","arxiv_id":"1702.00539","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-optimal-distributed-clustering","title":"Communication-Optimal Distributed Clustering","date":"2017-02-01","arxiv_id":"1702.00196","repositories_listed":0,"syntology":null},{"url":null,"slug":"density","title":"Density","date":"2017-02-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"design-analysis-and-application-of-a","title":"Design, Analysis and Application of A Volumetric Convolutional Neural Network","date":"2017-02-01","arxiv_id":"1702.00158","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-k-means-algorithm-based-on","title":"Improved K-means Algorithm Based on optimizing Initial Cluster Centers and Its Application","date":"2017-02-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"batch-incremental-shared-nearest-neighbor","title":"Batch Incremental Shared Nearest Neighbor Density Based Clustering Algorithm for Dynamic Datasets","date":"2017-01-31","arxiv_id":"1701.09049","repositories_listed":0,"syntology":null},{"url":null,"slug":"variable-selection-for-clustering-with","title":"Variable selection for clustering with Gaussian mixture models: state of the art","date":"2017-01-31","arxiv_id":"1701.08946","repositories_listed":0,"syntology":null},{"url":null,"slug":"3d-shape-retrieval-via-irrelevance-filtering","title":"3D Shape Retrieval via Irrelevance Filtering and Similarity Ranking (IF/SR)","date":"2017-01-30","arxiv_id":"1701.08869","repositories_listed":0,"syntology":null}],"record_sha256":"187efa4c4608a0024984c94bd967bb84cbee497211e4b3d71cb76e822ac009a9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}