{"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/26","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":26,"pages_in_order":108,"rows_per_page":100,"rows":[2501,2600],"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/25","next":"/task/clustering/papers/27","papers":[{"url":"/paper/iucm-at-semeval-2018-task-11-similar-topic","slug":"iucm-at-semeval-2018-task-11-similar-topic","title":"IUCM at SemEval-2018 Task 11: Similar-Topic Texts as a Comprehension Knowledge Source","date":"2018-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/tree-structured-dirichlet-processes-for","slug":"tree-structured-dirichlet-processes-for","title":"Tree Structured Dirichlet Processes for Hierarchical Morphological Segmentation","date":"2018-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-discriminative-latent-space-for","slug":"deep-discriminative-latent-space-for","title":"Deep Discriminative Latent Space for Clustering","date":"2018-05-28","arxiv_id":"1805.10795","repositories_listed":1,"syntology":null},{"url":"/paper/resolving-event-coreference-with-supervised","slug":"resolving-event-coreference-with-supervised","title":"Resolving Event Coreference with Supervised Representation Learning and Clustering-Oriented Regularization","date":"2018-05-28","arxiv_id":"1805.10985","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-spectral-clustering-using-random","slug":"scalable-spectral-clustering-using-random","title":"Scalable Spectral Clustering Using Random Binning Features","date":"2018-05-25","arxiv_id":"1805.11048","repositories_listed":1,"syntology":null},{"url":"/paper/kernel-estimated-nonparametric-overlap-based","slug":"kernel-estimated-nonparametric-overlap-based","title":"Kernel-estimated Nonparametric Overlap-Based Syncytial Clustering","date":"2018-05-24","arxiv_id":"1805.09505","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-monte-carlo-optimization","slug":"adaptive-monte-carlo-optimization","title":"Bandit-Based Monte Carlo Optimization for Nearest Neighbors","date":"2018-05-21","arxiv_id":"1805.08321","repositories_listed":1,"syntology":null},{"url":"/paper/quickshift-provably-good-initializations-for","slug":"quickshift-provably-good-initializations-for","title":"Quickshift++: Provably Good Initializations for Sample-Based Mean Shift","date":"2018-05-21","arxiv_id":"1805.07909","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-semantic-frame-induction-using","slug":"unsupervised-semantic-frame-induction-using","title":"Unsupervised Semantic Frame Induction using Triclustering","date":"2018-05-12","arxiv_id":"1805.04715","repositories_listed":1,"syntology":null},{"url":"/paper/branching-embedding-a-heuristic","slug":"branching-embedding-a-heuristic","title":"Branching embedding: A heuristic dimensionality reduction algorithm based on hierarchical clustering","date":"2018-05-06","arxiv_id":"1805.02161","repositories_listed":1,"syntology":null},{"url":"/paper/russian-word-sense-induction-by-clustering","slug":"russian-word-sense-induction-by-clustering","title":"Russian word sense induction by clustering averaged word embeddings","date":"2018-05-06","arxiv_id":"1805.02258","repositories_listed":1,"syntology":null},{"url":"/paper/hg-means-a-scalable-hybrid-genetic-algorithm","slug":"hg-means-a-scalable-hybrid-genetic-algorithm","title":"HG-means: A scalable hybrid genetic algorithm for minimum sum-of-squares clustering","date":"2018-04-25","arxiv_id":"1804.09813","repositories_listed":1,"syntology":null},{"url":"/paper/segmentation-of-scanning-tunneling-microscopy","slug":"segmentation-of-scanning-tunneling-microscopy","title":"Segmentation of Scanning Tunneling Microscopy Images Using Variational Methods and Empirical Wavelets","date":"2018-04-24","arxiv_id":"1804.08890","repositories_listed":1,"syntology":null},{"url":"/paper/neural-brane-neural-bayesian-personalized","slug":"neural-brane-neural-bayesian-personalized","title":"Neural-Brane: Neural Bayesian Personalized Ranking for Attributed Network Embedding","date":"2018-04-23","arxiv_id":"1804.08774","repositories_listed":1,"syntology":null},{"url":"/paper/mutual-information-maximization-for-simple","slug":"mutual-information-maximization-for-simple","title":"Mutual Information Maximization for Simple and Accurate Part-Of-Speech Induction","date":"2018-04-20","arxiv_id":"1804.07849","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mutual-information-maximization-for-simple#ran","syntology_url":"https://syntology.ai/paper/1804.07849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.07849"}},"official":{"repos":["karlstratos/mmi-tagger"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-representation-adversarial","slug":"unsupervised-representation-adversarial","title":"Unsupervised Representation Adversarial Learning Network: from Reconstruction to Generation","date":"2018-04-19","arxiv_id":"1804.07353","repositories_listed":1,"syntology":null},{"url":"/paper/image-clustering-with-optimization-algorithms","slug":"image-clustering-with-optimization-algorithms","title":"Image Clustering with Optimization Algorithms and Color Space","date":"2018-04-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/model-based-clustering-of-multi-tissue-gene","slug":"model-based-clustering-of-multi-tissue-gene","title":"Model-based clustering of multi-tissue gene expression data","date":"2018-04-18","arxiv_id":"1804.06911","repositories_listed":1,"syntology":null},{"url":"/paper/deep-multimodal-subspace-clustering-networks","slug":"deep-multimodal-subspace-clustering-networks","title":"Deep Multimodal Subspace Clustering Networks","date":"2018-04-17","arxiv_id":"1804.06498","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-solvers-for-sparse-subspace","slug":"efficient-solvers-for-sparse-subspace","title":"Efficient Solvers for Sparse Subspace Clustering","date":"2018-04-17","arxiv_id":"1804.06291","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-via-boundary-erosion","slug":"clustering-via-boundary-erosion","title":"Clustering via Boundary Erosion","date":"2018-04-12","arxiv_id":"1804.04312","repositories_listed":1,"syntology":null},{"url":"/paper/deep-autoencoding-models-for-unsupervised","slug":"deep-autoencoding-models-for-unsupervised","title":"Deep Autoencoding Models for Unsupervised Anomaly Segmentation in Brain MR Images","date":"2018-04-12","arxiv_id":"1804.04488","repositories_listed":1,"syntology":null},{"url":"/paper/seed-point-detection-of-clumped-convex","slug":"seed-point-detection-of-clumped-convex","title":"Seed-Point Detection of Clumped Convex Objects by Short-Range Attractive Long-Range Repulsive Particle Clustering","date":"2018-04-11","arxiv_id":"1804.04071","repositories_listed":1,"syntology":null},{"url":"/paper/a-real-time-and-unsupervised-face-re","slug":"a-real-time-and-unsupervised-face-re","title":"A real-time and unsupervised face Re-Identification system for Human-Robot Interaction","date":"2018-04-10","arxiv_id":"1804.03547","repositories_listed":1,"syntology":null},{"url":"/paper/dimensionalitys-blessing-clustering-images-by","slug":"dimensionalitys-blessing-clustering-images-by","title":"Dimensionality's Blessing: Clustering Images by Underlying Distribution","date":"2018-04-08","arxiv_id":"1804.02624","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-learning-of-mixture-models-with","slug":"unsupervised-learning-of-mixture-models-with","title":"Unsupervised Learning of GMM with a Uniform Background Component","date":"2018-04-08","arxiv_id":"1804.02744","repositories_listed":1,"syntology":null},{"url":"/paper/motion-segmentation-by-exploiting","slug":"motion-segmentation-by-exploiting","title":"Motion Segmentation by Exploiting Complementary Geometric Models","date":"2018-04-06","arxiv_id":"1804.02142","repositories_listed":1,"syntology":null},{"url":"/paper/multi-view-banded-spectral-clustering-with","slug":"multi-view-banded-spectral-clustering-with","title":"Multi-view Banded Spectral Clustering with Application to ICD9 Clustering","date":"2018-04-06","arxiv_id":"1804.02097","repositories_listed":1,"syntology":null},{"url":"/paper/sentiment-analysis-of-code-mixed-languages","slug":"sentiment-analysis-of-code-mixed-languages","title":"Sentiment Analysis of Code-Mixed Languages leveraging Resource Rich Languages","date":"2018-04-03","arxiv_id":"1804.00806","repositories_listed":1,"syntology":null},{"url":"/paper/tipsc-tips-and-corrections-for-programming","slug":"tipsc-tips-and-corrections-for-programming","title":"TipsC: Tips and Corrections for programming MOOCs","date":"2018-04-02","arxiv_id":"1804.00373","repositories_listed":1,"syntology":null},{"url":"/paper/alternative-objective-functions-for-deep","slug":"alternative-objective-functions-for-deep","title":"Alternative Objective Functions for Deep Clustering","date":"2018-04-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/copula-variational-bayes-inference-via","slug":"copula-variational-bayes-inference-via","title":"Copula Variational Bayes inference via information geometry","date":"2018-03-29","arxiv_id":"1803.10998","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-driven-deep-embedding-with","slug":"clustering-driven-deep-embedding-with","title":"Clustering-driven Deep Embedding with Pairwise Constraints","date":"2018-03-22","arxiv_id":"1803.08457","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-gray-pixel-for-statistical","slug":"revisiting-gray-pixel-for-statistical","title":"Revisiting Gray Pixel for Statistical Illumination Estimation","date":"2018-03-22","arxiv_id":"1803.08326","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-to-reduce-spatial-data-set-size","slug":"clustering-to-reduce-spatial-data-set-size","title":"Clustering to Reduce Spatial Data Set Size","date":"2018-03-21","arxiv_id":"1803.08101","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-generalized-method-of-moments","slug":"adversarial-generalized-method-of-moments","title":"Adversarial Generalized Method of Moments","date":"2018-03-19","arxiv_id":"1803.07164","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/adversarial-generalized-method-of-moments#ran","syntology_url":"https://syntology.ai/paper/1803.07164","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.07164"}},"official":{"repos":["vsyrgkanis/adversarial_gmm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-cluster-for-proposal-free","slug":"learning-to-cluster-for-proposal-free","title":"Learning to Cluster for Proposal-Free Instance Segmentation","date":"2018-03-17","arxiv_id":"1803.06459","repositories_listed":1,"syntology":null},{"url":"/paper/zero-shot-object-detection-learning-to","slug":"zero-shot-object-detection-learning-to","title":"Zero-Shot Object Detection: Learning to Simultaneously Recognize and Localize Novel Concepts","date":"2018-03-16","arxiv_id":"1803.06049","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/zero-shot-object-detection-learning-to#ran","syntology_url":"https://syntology.ai/paper/1803.06049","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.06049"}},"official":null}},{"url":"/paper/local-spectral-graph-convolution-for-point","slug":"local-spectral-graph-convolution-for-point","title":"Local Spectral Graph Convolution for Point Set Feature Learning","date":"2018-03-15","arxiv_id":"1803.05827","repositories_listed":1,"syntology":{"n":18,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":11,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/local-spectral-graph-convolution-for-point#ran","syntology_url":"https://syntology.ai/paper/1803.05827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.05827"}},"official":null}},{"url":"/paper/temporal-human-action-segmentation-via","slug":"temporal-human-action-segmentation-via","title":"Temporal Human Action Segmentation via Dynamic Clustering","date":"2018-03-15","arxiv_id":"1803.05790","repositories_listed":1,"syntology":null},{"url":"/paper/submodular-hypergraphs-p-laplacians-cheeger","slug":"submodular-hypergraphs-p-laplacians-cheeger","title":"Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering","date":"2018-03-10","arxiv_id":"1803.03833","repositories_listed":1,"syntology":null},{"url":"/paper/applicability-and-interpretation-of-the","slug":"applicability-and-interpretation-of-the","title":"Applicability and interpretation of the deterministic weighted cepstral distance","date":"2018-03-08","arxiv_id":"1803.03104","repositories_listed":1,"syntology":null},{"url":"/paper/gpsp-graph-partition-and-space-projection","slug":"gpsp-graph-partition-and-space-projection","title":"GPSP: Graph Partition and Space Projection based Approach for Heterogeneous Network Embedding","date":"2018-03-07","arxiv_id":"1803.02590","repositories_listed":1,"syntology":null},{"url":"/paper/multiple-kernel-k-means-clustering-using-min","slug":"multiple-kernel-k-means-clustering-using-min","title":"Robust Multiple Kernel k-means Clustering using Min-Max Optimization","date":"2018-03-06","arxiv_id":"1803.02458","repositories_listed":1,"syntology":null},{"url":"/paper/relative-pairwise-relationship-constrained","slug":"relative-pairwise-relationship-constrained","title":"Relative Pairwise Relationship Constrained Non-negative Matrix Factorisation","date":"2018-03-05","arxiv_id":"1803.02218","repositories_listed":1,"syntology":null},{"url":"/paper/the-power-mean-laplacian-for-multilayer-graph","slug":"the-power-mean-laplacian-for-multilayer-graph","title":"The Power Mean Laplacian for Multilayer Graph Clustering","date":"2018-03-01","arxiv_id":"1803.00491","repositories_listed":1,"syntology":null},{"url":"/paper/classifying-idiomatic-and-literal-expressions-2","slug":"classifying-idiomatic-and-literal-expressions-2","title":"Classifying Idiomatic and Literal Expressions Using Topic Models and Intensity of Emotions","date":"2018-02-27","arxiv_id":"1802.09961","repositories_listed":1,"syntology":null},{"url":"/paper/an-efficient-k-means-type-algorithm-for","slug":"an-efficient-k-means-type-algorithm-for","title":"An efficient $k$-means-type algorithm for clustering datasets with incomplete records","date":"2018-02-23","arxiv_id":"1802.08363","repositories_listed":1,"syntology":null},{"url":"/paper/ordered-preference-elicitation-strategies-for","slug":"ordered-preference-elicitation-strategies-for","title":"Ordered Preference Elicitation Strategies for Supporting Multi-Objective Decision Making","date":"2018-02-21","arxiv_id":"1802.07606","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/ordered-preference-elicitation-strategies-for#ran","syntology_url":"https://syntology.ai/paper/1802.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.07606"}},"official":{"repos":["lmzintgraf/gp_pref_elicit"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/memetic-graph-clustering","slug":"memetic-graph-clustering","title":"Memetic Graph Clustering","date":"2018-02-20","arxiv_id":"1802.07034","repositories_listed":1,"syntology":null},{"url":"/paper/tools-for-higher-order-network-analysis","slug":"tools-for-higher-order-network-analysis","title":"Tools for higher-order network analysis","date":"2018-02-19","arxiv_id":"1802.06820","repositories_listed":1,"syntology":null},{"url":"/paper/customer-segmentation","slug":"customer-segmentation","title":"Customer Segmentation","date":"2018-02-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/analysis-of-minimax-error-rate-for","slug":"analysis-of-minimax-error-rate-for","title":"Analysis of Minimax Error Rate for Crowdsourcing and Its Application to Worker Clustering Model","date":"2018-02-13","arxiv_id":"1802.04551","repositories_listed":1,"syntology":null},{"url":"/paper/tsviz-demystification-of-deep-learning-models","slug":"tsviz-demystification-of-deep-learning-models","title":"TSViz: Demystification of Deep Learning Models for Time-Series Analysis","date":"2018-02-08","arxiv_id":"1802.02952","repositories_listed":1,"syntology":null},{"url":"/paper/cadre-modeling-simultaneously-discovering","slug":"cadre-modeling-simultaneously-discovering","title":"Cadre Modeling: Simultaneously Discovering Subpopulations and Predictive Models","date":"2018-02-07","arxiv_id":"1802.02500","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-representation-selection-in","slug":"adaptive-representation-selection-in","title":"Contextual Bandit with Adaptive Feature Extraction","date":"2018-02-03","arxiv_id":"1802.00981","repositories_listed":1,"syntology":null},{"url":"/paper/onto2vec-joint-vector-based-representation-of","slug":"onto2vec-joint-vector-based-representation-of","title":"Onto2Vec: joint vector-based representation of biological entities and their ontology-based annotations","date":"2018-01-31","arxiv_id":"1802.00864","repositories_listed":1,"syntology":null},{"url":"/paper/links-a-high-dimensional-online-clustering","slug":"links-a-high-dimensional-online-clustering","title":"Links: A High-Dimensional Online Clustering Method","date":"2018-01-30","arxiv_id":"1801.10123","repositories_listed":1,"syntology":null},{"url":"/paper/covariance-based-dissimilarity-measures","slug":"covariance-based-dissimilarity-measures","title":"Covariance-based Dissimilarity Measures Applied to Clustering Wide-sense Stationary Ergodic Processes","date":"2018-01-27","arxiv_id":"1801.09049","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-hierarchical-graph-based","slug":"efficient-hierarchical-graph-based","title":"Efficient Hierarchical Graph-Based Segmentation of RGBD Videos","date":"2018-01-26","arxiv_id":"1801.08981","repositories_listed":1,"syntology":null},{"url":"/paper/object-category-learning-and-retrieval-with","slug":"object-category-learning-and-retrieval-with","title":"Object category learning and retrieval with weak supervision","date":"2018-01-26","arxiv_id":"1801.08985","repositories_listed":1,"syntology":null},{"url":"/paper/learning-networks-from-random-walk-based-node","slug":"learning-networks-from-random-walk-based-node","title":"Learning Networks from Random Walk-Based Node Similarities","date":"2018-01-23","arxiv_id":"1801.07386","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-open-relation-extraction","slug":"unsupervised-open-relation-extraction","title":"Unsupervised Open Relation Extraction","date":"2018-01-22","arxiv_id":"1801.07174","repositories_listed":1,"syntology":null},{"url":"/paper/unseen-class-discovery-in-open-world","slug":"unseen-class-discovery-in-open-world","title":"Unseen Class Discovery in Open-world Classification","date":"2018-01-17","arxiv_id":"1801.05609","repositories_listed":1,"syntology":null},{"url":"/paper/domain-specific-face-synthesis-for-video-face","slug":"domain-specific-face-synthesis-for-video-face","title":"Domain-Specific Face Synthesis for Video Face Recognition from a Single Sample Per Person","date":"2018-01-06","arxiv_id":"1801.01974","repositories_listed":1,"syntology":null},{"url":"/paper/deep-temporal-clustering-fully-unsupervised-1","slug":"deep-temporal-clustering-fully-unsupervised-1","title":"Deep Temporal Clustering: Fully unsupervised learning of time-domain features","date":"2018-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/particle-clustering-machine-a-dynamical","slug":"particle-clustering-machine-a-dynamical","title":"Particle Clustering Machine: A Dynamical System Based Approach","date":"2017-12-30","arxiv_id":"1801.01017","repositories_listed":1,"syntology":null},{"url":"/paper/the-information-bottleneck-and-geometric","slug":"the-information-bottleneck-and-geometric","title":"The information bottleneck and geometric clustering","date":"2017-12-27","arxiv_id":"1712.09657","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-information-bottleneck-and-geometric#ran","syntology_url":"https://syntology.ai/paper/1712.09657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.09657"}},"official":{"repos":["djstrouse/information-bottleneck"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/large-scale-object-discovery-and-detector","slug":"large-scale-object-discovery-and-detector","title":"Large-Scale Object Discovery and Detector Adaptation from Unlabeled Video","date":"2017-12-23","arxiv_id":"1712.08832","repositories_listed":1,"syntology":null},{"url":"/paper/a-mixture-of-matrix-variate-bilinear-factor","slug":"a-mixture-of-matrix-variate-bilinear-factor","title":"A Mixture of Matrix Variate Bilinear Factor Analyzers","date":"2017-12-22","arxiv_id":"1712.08664","repositories_listed":1,"syntology":null},{"url":"/paper/deep-unsupervised-clustering-using-mixture-of","slug":"deep-unsupervised-clustering-using-mixture-of","title":"Deep Unsupervised Clustering Using Mixture of Autoencoders","date":"2017-12-21","arxiv_id":"1712.07788","repositories_listed":1,"syntology":null},{"url":"/paper/path-based-spectral-clustering-guarantees","slug":"path-based-spectral-clustering-guarantees","title":"Path-Based Spectral Clustering: Guarantees, Robustness to Outliers, and Fast Algorithms","date":"2017-12-17","arxiv_id":"1712.06206","repositories_listed":1,"syntology":null},{"url":"/paper/cusboost-cluster-based-under-sampling-with","slug":"cusboost-cluster-based-under-sampling-with","title":"CUSBoost: Cluster-based Under-sampling with Boosting for Imbalanced Classification","date":"2017-12-12","arxiv_id":"1712.04356","repositories_listed":1,"syntology":null},{"url":"/paper/improving-malware-detection-accuracy-by","slug":"improving-malware-detection-accuracy-by","title":"Improving Malware Detection Accuracy by Extracting Icon Information","date":"2017-12-10","arxiv_id":"1712.03483","repositories_listed":1,"syntology":null},{"url":"/paper/a-streaming-algorithm-for-graph-clustering","slug":"a-streaming-algorithm-for-graph-clustering","title":"A Streaming Algorithm for Graph Clustering","date":"2017-12-09","arxiv_id":"1712.04337","repositories_listed":1,"syntology":null},{"url":"/paper/audio-visual-sentiment-analysis-for-learning","slug":"audio-visual-sentiment-analysis-for-learning","title":"Audio-Visual Sentiment Analysis for Learning Emotional Arcs in Movies","date":"2017-12-08","arxiv_id":"1712.02896","repositories_listed":1,"syntology":null},{"url":"/paper/joint-embedding-and-classification-for-sar","slug":"joint-embedding-and-classification-for-sar","title":"Successive Embedding and Classification Loss for Aerial Image Classification","date":"2017-12-05","arxiv_id":"1712.01511","repositories_listed":1,"syntology":null},{"url":"/paper/affinity-clustering-hierarchical-clustering","slug":"affinity-clustering-hierarchical-clustering","title":"Affinity Clustering: Hierarchical Clustering at Scale","date":"2017-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/yass-yet-another-spike-sorter","slug":"yass-yet-another-spike-sorter","title":"YASS: Yet Another Spike Sorter","date":"2017-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-cluster-in-order-to-transfer","slug":"learning-to-cluster-in-order-to-transfer","title":"Learning to cluster in order to transfer across domains and tasks","date":"2017-11-28","arxiv_id":"1711.10125","repositories_listed":1,"syntology":null},{"url":"/paper/relaxed-oracles-for-semi-supervised","slug":"relaxed-oracles-for-semi-supervised","title":"Relaxed Oracles for Semi-Supervised Clustering","date":"2017-11-20","arxiv_id":"1711.07433","repositories_listed":1,"syntology":null},{"url":"/paper/residual-gated-graph-convnets","slug":"residual-gated-graph-convnets","title":"Residual Gated Graph ConvNets","date":"2017-11-20","arxiv_id":"1711.07553","repositories_listed":1,"syntology":null},{"url":"/paper/quantum-transport-senses-community-structure","slug":"quantum-transport-senses-community-structure","title":"Quantum transport senses community structure in networks","date":"2017-11-14","arxiv_id":"1711.04979","repositories_listed":1,"syntology":null},{"url":"/paper/spatio-temporal-data-mining-a-survey-of","slug":"spatio-temporal-data-mining-a-survey-of","title":"Spatio-Temporal Data Mining: A Survey of Problems and Methods","date":"2017-11-13","arxiv_id":"1711.04710","repositories_listed":1,"syntology":null},{"url":"/paper/unified-spectral-clustering-with-optimal","slug":"unified-spectral-clustering-with-optimal","title":"Unified Spectral Clustering with Optimal Graph","date":"2017-11-12","arxiv_id":"1711.04258","repositories_listed":1,"syntology":null},{"url":"/paper/oversampling-for-imbalanced-learning-based-on","slug":"oversampling-for-imbalanced-learning-based-on","title":"Oversampling for Imbalanced Learning Based on K-Means and SMOTE","date":"2017-11-02","arxiv_id":"1711.00837","repositories_listed":1,"syntology":null},{"url":"/paper/improving-object-localization-with-fitness","slug":"improving-object-localization-with-fitness","title":"Improving Object Localization with Fitness NMS and Bounded IoU Loss","date":"2017-11-01","arxiv_id":"1711.00164","repositories_listed":1,"syntology":null},{"url":"/paper/latent-space-oddity-on-the-curvature-of-deep","slug":"latent-space-oddity-on-the-curvature-of-deep","title":"Latent Space Oddity: on the Curvature of Deep Generative Models","date":"2017-10-31","arxiv_id":"1710.11379","repositories_listed":1,"syntology":null},{"url":"/paper/communication-avoiding-optimization-methods","slug":"communication-avoiding-optimization-methods","title":"Communication-Avoiding Optimization Methods for Distributed Massive-Scale Sparse Inverse Covariance Estimation","date":"2017-10-30","arxiv_id":"1710.10769","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-hidden-memories-of-recurrent","slug":"understanding-hidden-memories-of-recurrent","title":"Understanding Hidden Memories of Recurrent Neural Networks","date":"2017-10-30","arxiv_id":"1710.10777","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-differentiation-in-pytorch","slug":"automatic-differentiation-in-pytorch","title":"Automatic Differentiation in PyTorch","date":"2017-10-28","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/powered-outer-probabilistic-clustering","slug":"powered-outer-probabilistic-clustering","title":"Powered Outer Probabilistic Clustering","date":"2017-10-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-bayesian-method-for-joint-clustering-of","slug":"a-bayesian-method-for-joint-clustering-of","title":"A Bayesian Method for Joint Clustering of Vectorial Data and Network Data","date":"2017-10-24","arxiv_id":"1710.08846","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-cluster-enumeration-criterion-for","slug":"bayesian-cluster-enumeration-criterion-for","title":"Bayesian Cluster Enumeration Criterion for Unsupervised Learning","date":"2017-10-22","arxiv_id":"1710.07954","repositories_listed":1,"syntology":null},{"url":"/paper/binary-classification-from-positive","slug":"binary-classification-from-positive","title":"Binary Classification from Positive-Confidence Data","date":"2017-10-19","arxiv_id":"1710.07138","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/binary-classification-from-positive#ran","syntology_url":"https://syntology.ai/paper/1710.07138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.07138"}},"official":{"repos":["takashiishida/pconf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/temporally-reweighted-chinese-restaurant","slug":"temporally-reweighted-chinese-restaurant","title":"Temporally-Reweighted Chinese Restaurant Process Mixtures for Clustering, Imputing, and Forecasting Multivariate Time Series","date":"2017-10-18","arxiv_id":"1710.06900","repositories_listed":1,"syntology":null},{"url":"/paper/vampnets-deep-learning-of-molecular-kinetics","slug":"vampnets-deep-learning-of-molecular-kinetics","title":"VAMPnets: Deep learning of molecular kinetics","date":"2017-10-16","arxiv_id":"1710.06012","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/vampnets-deep-learning-of-molecular-kinetics#ran","syntology_url":"https://syntology.ai/paper/1710.06012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.06012"}},"official":{"repos":["markovmodel/deeptime"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/stream-graphs-and-link-streams-for-the","slug":"stream-graphs-and-link-streams-for-the","title":"Stream Graphs and Link Streams for the Modeling of Interactions over Time","date":"2017-10-11","arxiv_id":"1710.04073","repositories_listed":1,"syntology":null},{"url":"/paper/toward-multi-diversified-ensemble-clustering","slug":"toward-multi-diversified-ensemble-clustering","title":"Toward Multidiversified Ensemble Clustering of High-Dimensional Data: From Subspaces to Metrics and Beyond","date":"2017-10-09","arxiv_id":"1710.03113","repositories_listed":1,"syntology":null},{"url":"/paper/a-new-spectral-clustering-algorithm","slug":"a-new-spectral-clustering-algorithm","title":"A New Spectral Clustering Algorithm","date":"2017-10-07","arxiv_id":"1710.02756","repositories_listed":1,"syntology":null}],"record_sha256":"8f717904b11a09e03f478af437f57f5a417a412f5609c43f698e590c8e4e5b82","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}