{"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/24","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":24,"pages_in_order":108,"rows_per_page":100,"rows":[2301,2400],"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/23","next":"/task/clustering/papers/25","papers":[{"url":"/paper/a-fully-automated-periodicity-detection-in","slug":"a-fully-automated-periodicity-detection-in","title":"A fully automated periodicity detection in time series","date":"2019-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-procedural-abstractions-and","slug":"learning-procedural-abstractions-and","title":"Learning Procedural Abstractions and Evaluating Discrete Latent Temporal Structure","date":"2019-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/higan-cosmic-neutral-hydrogen-with-generative","slug":"higan-cosmic-neutral-hydrogen-with-generative","title":"HIGAN: Cosmic Neutral Hydrogen with Generative Adversarial Networks","date":"2019-04-29","arxiv_id":"1904.12846","repositories_listed":1,"syntology":null},{"url":"/paper/190412359","slug":"190412359","title":"Unsupervised Feature Learning for Point Cloud by Contrasting and Clustering With Graph Convolutional Neural Network","date":"2019-04-28","arxiv_id":"1904.12359","repositories_listed":1,"syntology":null},{"url":"/paper/robust-metric-learning-based-on-the-rescaled","slug":"robust-metric-learning-based-on-the-rescaled","title":"Robust Metric Learning based on the Rescaled Hinge Loss","date":"2019-04-26","arxiv_id":"1904.11711","repositories_listed":1,"syntology":null},{"url":"/paper/deep-constrained-dominant-sets-for-person-re","slug":"deep-constrained-dominant-sets-for-person-re","title":"Deep Constrained Dominant Sets for Person Re-identification","date":"2019-04-25","arxiv_id":"1904.11397","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/deep-constrained-dominant-sets-for-person-re#ran","syntology_url":"https://syntology.ai/paper/1904.11397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.11397"}},"official":null}},{"url":"/paper/discrete-optimal-graph-clustering","slug":"discrete-optimal-graph-clustering","title":"Discrete Optimal Graph Clustering","date":"2019-04-25","arxiv_id":"1904.11266","repositories_listed":1,"syntology":null},{"url":"/paper/divide-and-conquer-a-deep-casa-approach-to","slug":"divide-and-conquer-a-deep-casa-approach-to","title":"Divide and Conquer: A Deep CASA Approach to Talker-independent Monaural Speaker Separation","date":"2019-04-25","arxiv_id":"1904.11148","repositories_listed":1,"syntology":null},{"url":"/paper/deep-embedded-som-joint-representation","slug":"deep-embedded-som-joint-representation","title":"Deep Embedded SOM: Joint Representation Learning and Self-Organization","date":"2019-04-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/instance-ranking-and-numerosity-reduction","slug":"instance-ranking-and-numerosity-reduction","title":"Instance Ranking and Numerosity Reduction Using Matrix Decomposition and Subspace Learning","date":"2019-04-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/energy-based-self-attentive-learning-of","slug":"energy-based-self-attentive-learning-of","title":"Energy-based Self-attentive Learning of Abstractive Communities for Spoken Language Understanding","date":"2019-04-20","arxiv_id":"1904.09491","repositories_listed":1,"syntology":null},{"url":"/paper/sponge-a-generalized-eigenproblem-for","slug":"sponge-a-generalized-eigenproblem-for","title":"SPONGE: A generalized eigenproblem for clustering signed networks","date":"2019-04-18","arxiv_id":"1904.08575","repositories_listed":1,"syntology":null},{"url":"/paper/clustered-object-detection-in-aerial-images","slug":"clustered-object-detection-in-aerial-images","title":"Clustered Object Detection in Aerial Images","date":"2019-04-16","arxiv_id":"1904.08008","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/clustered-object-detection-in-aerial-images#ran","syntology_url":"https://syntology.ai/paper/1904.08008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08008"}},"official":null}},{"url":"/paper/improved-speech-separation-with-time-and","slug":"improved-speech-separation-with-time-and","title":"Improved Speech Separation with Time-and-Frequency Cross-domain Joint Embedding and Clustering","date":"2019-04-16","arxiv_id":"1904.07845","repositories_listed":1,"syntology":null},{"url":"/paper/deep-comprehensive-correlation-mining-for","slug":"deep-comprehensive-correlation-mining-for","title":"Deep Comprehensive Correlation Mining for Image Clustering","date":"2019-04-15","arxiv_id":"1904.06925","repositories_listed":1,"syntology":null},{"url":"/paper/multiple-kernel-learning-for-integrative","slug":"multiple-kernel-learning-for-integrative","title":"Multiple kernel learning for integrative consensus clustering of 'omic datasets","date":"2019-04-15","arxiv_id":"1904.07701","repositories_listed":1,"syntology":null},{"url":"/paper/tracing-forum-posts-to-mooc-content-using","slug":"tracing-forum-posts-to-mooc-content-using","title":"Tracing Forum Posts to MOOC Content using Topic Analysis","date":"2019-04-15","arxiv_id":"1904.07307","repositories_listed":1,"syntology":null},{"url":"/paper/topic-grouper-an-agglomerative-clustering","slug":"topic-grouper-an-agglomerative-clustering","title":"Topic Grouper: An Agglomerative Clustering Approach to Topic Modeling","date":"2019-04-13","arxiv_id":"1904.06483","repositories_listed":1,"syntology":null},{"url":"/paper/a-grounded-unsupervised-universal-part-of","slug":"a-grounded-unsupervised-universal-part-of","title":"A Grounded Unsupervised Universal Part-of-Speech Tagger for Low-Resource Languages","date":"2019-04-10","arxiv_id":"1904.05426","repositories_listed":1,"syntology":null},{"url":"/paper/analyzing-dynamical-brain-functional","slug":"analyzing-dynamical-brain-functional","title":"Analyzing Dynamical Brain Functional Connectivity As Trajectories on Space of Covariance Matrices","date":"2019-04-10","arxiv_id":"1904.05449","repositories_listed":1,"syntology":null},{"url":"/paper/attraction-repulsion-clustering-with","slug":"attraction-repulsion-clustering-with","title":"Attraction-Repulsion clustering with applications to fairness","date":"2019-04-10","arxiv_id":"1904.05254","repositories_listed":1,"syntology":null},{"url":"/paper/discovering-patterns-of-online-popularity","slug":"discovering-patterns-of-online-popularity","title":"Discovering patterns of online popularity from time series","date":"2019-04-10","arxiv_id":"1904.04994","repositories_listed":1,"syntology":null},{"url":"/paper/instance-segmentation-of-biological-images","slug":"instance-segmentation-of-biological-images","title":"Instance Segmentation of Biological Images Using Harmonic Embeddings","date":"2019-04-10","arxiv_id":"1904.05257","repositories_listed":1,"syntology":null},{"url":"/paper/crad-clustering-with-robust-autocuts-and","slug":"crad-clustering-with-robust-autocuts-and","title":"CRAD: Clustering with Robust Autocuts and Depth","date":"2019-04-08","arxiv_id":"1904.04020","repositories_listed":1,"syntology":null},{"url":"/paper/relation-aware-global-attention","slug":"relation-aware-global-attention","title":"Relation-Aware Global Attention for Person Re-identification","date":"2019-04-05","arxiv_id":"1904.02998","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/relation-aware-global-attention#ran","syntology_url":"https://syntology.ai/paper/1904.02998","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02998"}},"official":{"repos":["microsoft/Relation-Aware-Global-Attention-Networks"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/simultaneous-dimensionality-and-complexity","slug":"simultaneous-dimensionality-and-complexity","title":"Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering","date":"2019-04-05","arxiv_id":"1904.02926","repositories_listed":1,"syntology":null},{"url":"/paper/community-detection-over-a-heterogeneous","slug":"community-detection-over-a-heterogeneous","title":"Community detection over a heterogeneous population of non-aligned networks","date":"2019-04-04","arxiv_id":"1904.05332","repositories_listed":1,"syntology":null},{"url":"/paper/learning-for-multi-type-subspace-clustering","slug":"learning-for-multi-type-subspace-clustering","title":"Learning for Multi-Type Subspace Clustering","date":"2019-04-03","arxiv_id":"1904.02075","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-continual-learning-and-self","slug":"unsupervised-continual-learning-and-self","title":"Unsupervised Progressive Learning and the STAM Architecture","date":"2019-04-03","arxiv_id":"1904.02021","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":1,"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/unsupervised-continual-learning-and-self#ran","syntology_url":"https://syntology.ai/paper/1904.02021","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02021"}},"official":{"repos":["CameronTaylorFL/stam"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/analyzing-polarization-in-social-media-method","slug":"analyzing-polarization-in-social-media-method","title":"Analyzing Polarization in Social Media: Method and Application to Tweets on 21 Mass Shootings","date":"2019-04-02","arxiv_id":"1904.01596","repositories_listed":1,"syntology":null},{"url":"/paper/local-aggregation-for-unsupervised-learning","slug":"local-aggregation-for-unsupervised-learning","title":"Local Aggregation for Unsupervised Learning of Visual Embeddings","date":"2019-03-29","arxiv_id":"1903.12355","repositories_listed":1,"syntology":null},{"url":"/paper/cluster-alignment-with-a-teacher-for","slug":"cluster-alignment-with-a-teacher-for","title":"Cluster Alignment with a Teacher for Unsupervised Domain Adaptation","date":"2019-03-24","arxiv_id":"1903.09980","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cluster-alignment-with-a-teacher-for#ran","syntology_url":"https://syntology.ai/paper/1903.09980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.09980"}},"official":{"repos":["thudzj/CAT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/retinal-oct-disease-classification-with","slug":"retinal-oct-disease-classification-with","title":"Retinal OCT disease classification with variational autoencoder regularization","date":"2019-03-23","arxiv_id":"1904.00790","repositories_listed":1,"syntology":null},{"url":"/paper/an-internal-validity-index-based-on-density","slug":"an-internal-validity-index-based-on-density","title":"An Internal Validity Index Based on Density-Involved Distance","date":"2019-03-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/node-embedding-over-temporal-graphs","slug":"node-embedding-over-temporal-graphs","title":"Node Embedding over Temporal Graphs","date":"2019-03-21","arxiv_id":"1903.08889","repositories_listed":1,"syntology":null},{"url":"/paper/identifying-experts-in-software-libraries-and","slug":"identifying-experts-in-software-libraries-and","title":"Identifying Experts in Software Libraries and Frameworks among GitHub Users","date":"2019-03-19","arxiv_id":"1903.08113","repositories_listed":1,"syntology":null},{"url":"/paper/deep-feature-selection-using-a-teacher","slug":"deep-feature-selection-using-a-teacher","title":"Deep Feature Selection using a Teacher-Student Network","date":"2019-03-17","arxiv_id":"1903.07045","repositories_listed":1,"syntology":null},{"url":"/paper/spherical-principal-component-analysis","slug":"spherical-principal-component-analysis","title":"Spherical Principal Component Analysis","date":"2019-03-16","arxiv_id":"1903.06877","repositories_listed":1,"syntology":null},{"url":"/paper/the-role-of-clustering-in-the-adoption-of","slug":"the-role-of-clustering-in-the-adoption-of","title":"The Role of Clustering in the Adoption of Organic Dairy: A Longitudinal Networks Analysis between 2002 and 2015","date":"2019-03-13","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-resolution-parameters-for-graph","slug":"learning-resolution-parameters-for-graph","title":"Learning Resolution Parameters for Graph Clustering","date":"2019-03-12","arxiv_id":"1903.05246","repositories_listed":1,"syntology":null},{"url":"/paper/similarity-learning-via-kernel-preserving","slug":"similarity-learning-via-kernel-preserving","title":"Similarity Learning via Kernel Preserving Embedding","date":"2019-03-11","arxiv_id":"1903.04235","repositories_listed":1,"syntology":null},{"url":"/paper/one-pass-sparsified-gaussian-mixtures","slug":"one-pass-sparsified-gaussian-mixtures","title":"One-Pass Sparsified Gaussian Mixtures","date":"2019-03-10","arxiv_id":"1903.04056","repositories_listed":1,"syntology":null},{"url":"/paper/a-deep-learning-based-approach-to-vm-behavior","slug":"a-deep-learning-based-approach-to-vm-behavior","title":"A Deep Learning based approach to VM behavior identification in cloud systems","date":"2019-03-05","arxiv_id":"1903.01930","repositories_listed":1,"syntology":null},{"url":"/paper/convex-covariate-clustering-for","slug":"convex-covariate-clustering-for","title":"Convex Covariate Clustering for Classification","date":"2019-03-05","arxiv_id":"1903.01680","repositories_listed":1,"syntology":null},{"url":"/paper/multi-modal-forest-optimization-algorithm","slug":"multi-modal-forest-optimization-algorithm","title":"Multi-Modal Forest Optimization Algorithm","date":"2019-03-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-learning-of-face","slug":"self-supervised-learning-of-face","title":"Self-Supervised Learning of Face Representations for Video Face Clustering","date":"2019-03-03","arxiv_id":"1903.01000","repositories_listed":1,"syntology":null},{"url":"/paper/gap-generalizable-approximate-graph","slug":"gap-generalizable-approximate-graph","title":"GAP: Generalizable Approximate Graph Partitioning Framework","date":"2019-03-02","arxiv_id":"1903.00614","repositories_listed":1,"syntology":null},{"url":"/paper/fast-adaptive-k-means-subspace-clustering-for","slug":"fast-adaptive-k-means-subspace-clustering-for","title":"Fast Adaptive K-Means Subspace Clustering for High-Dimensional Data","date":"2019-03-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/efficient-parameter-free-clustering-using","slug":"efficient-parameter-free-clustering-using","title":"Efficient Parameter-free Clustering Using First Neighbor Relations","date":"2019-02-28","arxiv_id":"1902.11266","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficient-parameter-free-clustering-using#ran","syntology_url":"https://syntology.ai/paper/1902.11266","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.11266"}},"official":{"repos":["ssarfraz/FINCH-CLustering"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/salient-object-detection-on-hyperspectral","slug":"salient-object-detection-on-hyperspectral","title":"Salient object detection on hyperspectral images using features learned from unsupervised segmentation task","date":"2019-02-28","arxiv_id":"1902.10993","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-by-the-local-intrinsic-dimension","slug":"clustering-by-the-local-intrinsic-dimension","title":"Data segmentation based on the local intrinsic dimension","date":"2019-02-27","arxiv_id":"1902.10459","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-video-classification-using-fewer","slug":"efficient-video-classification-using-fewer","title":"Efficient Video Classification Using Fewer Frames","date":"2019-02-27","arxiv_id":"1902.10640","repositories_listed":1,"syntology":null},{"url":"/paper/single-image-piece-wise-planar-3d","slug":"single-image-piece-wise-planar-3d","title":"Single-Image Piece-wise Planar 3D Reconstruction via Associative Embedding","date":"2019-02-26","arxiv_id":"1902.09777","repositories_listed":1,"syntology":{"n":13,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 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; 2 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/single-image-piece-wise-planar-3d#ran","syntology_url":"https://syntology.ai/paper/1902.09777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.09777"}},"official":{"repos":["svip-lab/PlanarReconstruction"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-network-embedding-for-graph","slug":"unsupervised-network-embedding-for-graph","title":"Unsupervised Network Embedding for Graph Visualization, Clustering and Classification","date":"2019-02-25","arxiv_id":"1903.05980","repositories_listed":1,"syntology":null},{"url":"/paper/centroid-networks-for-few-shot-clustering-and","slug":"centroid-networks-for-few-shot-clustering-and","title":"Are Few-Shot Learning Benchmarks too Simple ? Solving them without Task Supervision at Test-Time","date":"2019-02-22","arxiv_id":"1902.08605","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/centroid-networks-for-few-shot-clustering-and#ran","syntology_url":"https://syntology.ai/paper/1902.08605","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.08605"}},"official":null}},{"url":"/paper/model-based-clustering-in-very-high","slug":"model-based-clustering-in-very-high","title":"Model-based clustering in very high dimensions via adaptive projections","date":"2019-02-22","arxiv_id":"1902.08472","repositories_listed":1,"syntology":null},{"url":"/paper/twitch-plays-pokemon-machine-learns-twitch","slug":"twitch-plays-pokemon-machine-learns-twitch","title":"Twitch Plays Pokemon, Machine Learns Twitch: Unsupervised Context-Aware Anomaly Detection for Identifying Trolls in Streaming Data","date":"2019-02-17","arxiv_id":"1902.06208","repositories_listed":1,"syntology":null},{"url":"/paper/a-probabilistic-framework-for-quantum","slug":"a-probabilistic-framework-for-quantum","title":"A Probabilistic framework for Quantum Clustering","date":"2019-02-14","arxiv_id":"1902.05578","repositories_listed":1,"syntology":null},{"url":"/paper/graph-rise-graph-regularized-image-semantic","slug":"graph-rise-graph-regularized-image-semantic","title":"Graph-RISE: Graph-Regularized Image Semantic Embedding","date":"2019-02-14","arxiv_id":"1902.10814","repositories_listed":1,"syntology":null},{"url":"/paper/self-adaptive-single-and-multi-illuminant","slug":"self-adaptive-single-and-multi-illuminant","title":"Self-adaptive Single and Multi-illuminant Estimation Framework based on Deep Learning","date":"2019-02-13","arxiv_id":"1902.04705","repositories_listed":1,"syntology":null},{"url":"/paper/masc-multi-scale-affinity-with-sparse","slug":"masc-multi-scale-affinity-with-sparse","title":"MASC: Multi-scale Affinity with Sparse Convolution for 3D Instance Segmentation","date":"2019-02-12","arxiv_id":"1902.04478","repositories_listed":1,"syntology":null},{"url":"/paper/nearest-neighbor-median-shift-clustering-for","slug":"nearest-neighbor-median-shift-clustering-for","title":"Nearest Neighbor Median Shift Clustering for Binary Data","date":"2019-02-11","arxiv_id":"1902.04181","repositories_listed":1,"syntology":null},{"url":"/paper/elki-a-large-open-source-library-for-data","slug":"elki-a-large-open-source-library-for-data","title":"ELKI: A large open-source library for data analysis - ELKI Release 0.7.5 \"Heidelberg\"","date":"2019-02-10","arxiv_id":"1902.03616","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":1,"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/elki-a-large-open-source-library-for-data#ran","syntology_url":"https://syntology.ai/paper/1902.03616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.03616"}},"official":{"repos":["elki-project/elki"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-fair-clustering","slug":"scalable-fair-clustering","title":"Scalable Fair Clustering","date":"2019-02-10","arxiv_id":"1902.03519","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-fair-clustering#ran","syntology_url":"https://syntology.ai/paper/1902.03519","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.03519"}},"official":{"repos":["talwagner/fair_clustering"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stampnet-unsupervised-multi-class-object","slug":"stampnet-unsupervised-multi-class-object","title":"StampNet: unsupervised multi-class object discovery","date":"2019-02-07","arxiv_id":"1902.02693","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/stampnet-unsupervised-multi-class-object#ran","syntology_url":"https://syntology.ai/paper/1902.02693","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.02693"}},"official":null}},{"url":"/paper/clear-a-consistent-lifting-embedding-and","slug":"clear-a-consistent-lifting-embedding-and","title":"CLEAR: A Consistent Lifting, Embedding, and Alignment Rectification Algorithm for Multi-View Data Association","date":"2019-02-06","arxiv_id":"1902.02256","repositories_listed":1,"syntology":null},{"url":"/paper/word-embeddings-for-entity-annotated-texts","slug":"word-embeddings-for-entity-annotated-texts","title":"Word Embeddings for Entity-annotated Texts","date":"2019-02-06","arxiv_id":"1902.02078","repositories_listed":1,"syntology":null},{"url":"/paper/meta-amortized-variational-inference-and","slug":"meta-amortized-variational-inference-and","title":"Meta-Amortized Variational Inference and Learning","date":"2019-02-05","arxiv_id":"1902.01950","repositories_listed":1,"syntology":{"n":15,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/meta-amortized-variational-inference-and#ran","syntology_url":"https://syntology.ai/paper/1902.01950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.01950"}},"official":null}},{"url":"/paper/spaces-of-clusterings","slug":"spaces-of-clusterings","title":"Visualization tools for parameter selection in cluster analysis","date":"2019-02-04","arxiv_id":"1902.01436","repositories_listed":1,"syntology":null},{"url":"/paper/cesi-canonicalizing-open-knowledge-bases","slug":"cesi-canonicalizing-open-knowledge-bases","title":"CESI: Canonicalizing Open Knowledge Bases using Embeddings and Side Information","date":"2019-02-01","arxiv_id":"1902.00172","repositories_listed":1,"syntology":null},{"url":"/paper/experiment-based-detection-of-service","slug":"experiment-based-detection-of-service","title":"Experiment-based detection of service disruption attacks in optical networks using data analytics and unsupervised learning","date":"2019-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/normalized-wasserstein-distance-for-mixture","slug":"normalized-wasserstein-distance-for-mixture","title":"Normalized Wasserstein Distance for Mixture Distributions with Applications in Adversarial Learning and Domain Adaptation","date":"2019-02-01","arxiv_id":"1902.00415","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-nonparametric-multiway-regression","slug":"bayesian-nonparametric-multiway-regression","title":"Bayesian nonparametric multiway regression for clustered binomial data","date":"2019-01-31","arxiv_id":"1901.11172","repositories_listed":1,"syntology":null},{"url":"/paper/feature-concatenation-multi-view-subspace","slug":"feature-concatenation-multi-view-subspace","title":"Feature Concatenation Multi-view Subspace Clustering","date":"2019-01-30","arxiv_id":"1901.10657","repositories_listed":1,"syntology":null},{"url":"/paper/a-parallel-projection-method-for-metric","slug":"a-parallel-projection-method-for-metric","title":"A Parallel Projection Method for Metric Constrained Optimization","date":"2019-01-29","arxiv_id":"1901.10084","repositories_listed":1,"syntology":null},{"url":"/paper/deep-constrained-clustering-algorithms-and","slug":"deep-constrained-clustering-algorithms-and","title":"A Framework for Deep Constrained Clustering -- Algorithms and Advances","date":"2019-01-29","arxiv_id":"1901.10061","repositories_listed":1,"syntology":null},{"url":"/paper/throttling-malware-families-in-2d","slug":"throttling-malware-families-in-2d","title":"Throttling Malware Families in 2D","date":"2019-01-29","arxiv_id":"1901.10590","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-person-re-identification-by-deep","slug":"unsupervised-person-re-identification-by-deep","title":"Unsupervised Person Re-identification by Deep Asymmetric Metric Embedding","date":"2019-01-29","arxiv_id":"1901.10177","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-outdoor-webcams-for-local","slug":"leveraging-outdoor-webcams-for-local","title":"Leveraging Outdoor Webcams for Local Descriptor Learning","date":"2019-01-28","arxiv_id":"1901.09780","repositories_listed":1,"syntology":null},{"url":"/paper/information-theoretic-understanding-of","slug":"information-theoretic-understanding-of","title":"Information-Theoretic Understanding of Population Risk Improvement with Model Compression","date":"2019-01-27","arxiv_id":"1901.09421","repositories_listed":1,"syntology":null},{"url":"/paper/provably-efficient-rl-with-rich-observations","slug":"provably-efficient-rl-with-rich-observations","title":"Provably efficient RL with Rich Observations via Latent State Decoding","date":"2019-01-25","arxiv_id":"1901.09018","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/provably-efficient-rl-with-rich-observations#ran","syntology_url":"https://syntology.ai/paper/1901.09018","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09018"}},"official":{"repos":["Microsoft/StateDecoding"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/virtual-conditional-generative-adversarial","slug":"virtual-conditional-generative-adversarial","title":"Virtual Conditional Generative Adversarial Networks","date":"2019-01-25","arxiv_id":"1901.09822","repositories_listed":1,"syntology":null},{"url":"/paper/fair-k-center-clustering-for-data","slug":"fair-k-center-clustering-for-data","title":"Fair k-Center Clustering for Data Summarization","date":"2019-01-24","arxiv_id":"1901.08628","repositories_listed":1,"syntology":null},{"url":"/paper/guarantees-for-spectral-clustering-with","slug":"guarantees-for-spectral-clustering-with","title":"Guarantees for Spectral Clustering with Fairness Constraints","date":"2019-01-24","arxiv_id":"1901.08668","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-deep-embedded-clustering","slug":"semi-supervised-deep-embedded-clustering","title":"Semi-supervised deep embedded clustering","date":"2019-01-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/semi-unsupervised-learning-with-deep","slug":"semi-unsupervised-learning-with-deep","title":"Semi-Unsupervised Learning: Clustering and Classifying using Ultra-Sparse Labels","date":"2019-01-24","arxiv_id":"1901.08560","repositories_listed":1,"syntology":null},{"url":"/paper/deep-clustering-with-a-dynamic-autoencoder","slug":"deep-clustering-with-a-dynamic-autoencoder","title":"Deep Clustering with a Dynamic Autoencoder: From Reconstruction towards Centroids Construction","date":"2019-01-23","arxiv_id":"1901.07752","repositories_listed":1,"syntology":null},{"url":"/paper/max-margin-class-imbalanced-learning-with","slug":"max-margin-class-imbalanced-learning-with","title":"Max-margin Class Imbalanced Learning with Gaussian Affinity","date":"2019-01-23","arxiv_id":"1901.07711","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/max-margin-class-imbalanced-learning-with#ran","syntology_url":"https://syntology.ai/paper/1901.07711","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.07711"}},"official":null}},{"url":"/paper/communitygan-community-detection-with","slug":"communitygan-community-detection-with","title":"CommunityGAN: Community Detection with Generative Adversarial Nets","date":"2019-01-20","arxiv_id":"1901.06631","repositories_listed":1,"syntology":null},{"url":"/paper/fitting-a-mixture-distribution-to-data","slug":"fitting-a-mixture-distribution-to-data","title":"Fitting A Mixture Distribution to Data: Tutorial","date":"2019-01-20","arxiv_id":"1901.06708","repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-robust-dynamic-hand-gesture","slug":"fast-and-robust-dynamic-hand-gesture","title":"Fast and Robust Dynamic Hand Gesture Recognition via Key Frames Extraction and Feature Fusion","date":"2019-01-15","arxiv_id":"1901.04622","repositories_listed":1,"syntology":null},{"url":"/paper/attributed-network-embedding-via-subspace","slug":"attributed-network-embedding-via-subspace","title":"Attributed Network Embedding via Subspace Discovery","date":"2019-01-14","arxiv_id":"1901.04095","repositories_listed":1,"syntology":null},{"url":"/paper/posterior-inference-unchained-with-el_2o","slug":"posterior-inference-unchained-with-el_2o","title":"Posterior inference unchained with EL_2O","date":"2019-01-14","arxiv_id":"1901.04454","repositories_listed":1,"syntology":null},{"url":"/paper/fair-algorithms-for-clustering","slug":"fair-algorithms-for-clustering","title":"Fair Algorithms for Clustering","date":"2019-01-08","arxiv_id":"1901.02393","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-visualization-and-fast-computation","slug":"dynamic-visualization-and-fast-computation","title":"Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization","date":"2019-01-06","arxiv_id":"1901.01477","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-graph-based-label-propagation-for","slug":"dynamic-graph-based-label-propagation-for","title":"Dynamic Graph-Based Label Propagation for Density Peaks Clustering","date":"2019-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/mixed-order-spectral-clustering-for-networks","slug":"mixed-order-spectral-clustering-for-networks","title":"Mixed-Order Spectral Clustering for Networks","date":"2018-12-25","arxiv_id":"1812.10140","repositories_listed":1,"syntology":null},{"url":"/paper/parallel-clustering-of-single-cell","slug":"parallel-clustering-of-single-cell","title":"Parallel Clustering of Single Cell Transcriptomic Data with Split-Merge Sampling on Dirichlet Process Mixtures","date":"2018-12-25","arxiv_id":"1812.10048","repositories_listed":1,"syntology":null},{"url":"/paper/unifying-topic-sentiment-preference-in-an-hdp","slug":"unifying-topic-sentiment-preference-in-an-hdp","title":"Unifying Topic, Sentiment & Preference in an HDP-Based Rating Regression Model for Online Reviews","date":"2018-12-19","arxiv_id":"1812.07805","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-oriented-representation-learning","slug":"clustering-oriented-representation-learning","title":"Clustering-Oriented Representation Learning with Attractive-Repulsive Loss","date":"2018-12-18","arxiv_id":"1812.07627","repositories_listed":1,"syntology":null}],"record_sha256":"64902ed89b30532c3a0cd91db530a8840688cc98b7baabb4d9fe082e6ef3a477","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}