{"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/4","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":4,"pages_in_order":108,"rows_per_page":100,"rows":[301,400],"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/3","next":"/task/clustering/papers/5","papers":[{"url":"/paper/exploratory-analysis-of-covid-19-tweets-using","slug":"exploratory-analysis-of-covid-19-tweets-using","title":"Exploratory Analysis of Covid-19 Tweets using Topic Modeling, UMAP, and DiGraphs","date":"2020-05-06","arxiv_id":"2005.03082","repositories_listed":2,"syntology":null},{"url":"/paper/exact-a-collaboration-toolset-for-algorithm","slug":"exact-a-collaboration-toolset-for-algorithm","title":"EXACT: A collaboration toolset for algorithm-aided annotation of images with annotation version control","date":"2020-04-30","arxiv_id":"2004.14595","repositories_listed":2,"syntology":null},{"url":"/paper/multi-domain-learning-and-identity-mining-for","slug":"multi-domain-learning-and-identity-mining-for","title":"Multi-Domain Learning and Identity Mining for Vehicle Re-Identification","date":"2020-04-22","arxiv_id":"2004.10547","repositories_listed":2,"syntology":null},{"url":"/paper/data-efficient-and-weakly-supervised","slug":"data-efficient-and-weakly-supervised","title":"Data Efficient and Weakly Supervised Computational Pathology on Whole Slide Images","date":"2020-04-20","arxiv_id":"2004.09666","repositories_listed":2,"syntology":null},{"url":"/paper/flow-based-algorithms-for-improving-clusters","slug":"flow-based-algorithms-for-improving-clusters","title":"Flow-based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance","date":"2020-04-20","arxiv_id":"2004.09608","repositories_listed":2,"syntology":null},{"url":"/paper/patchattack-a-black-box-texture-based-attack","slug":"patchattack-a-black-box-texture-based-attack","title":"PatchAttack: A Black-box Texture-based Attack with Reinforcement Learning","date":"2020-04-12","arxiv_id":"2004.05682","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/patchattack-a-black-box-texture-based-attack#ran","syntology_url":"https://syntology.ai/paper/2004.05682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05682"}},"official":{"repos":["Chenglin-Yang/PatchAttack"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/unsupervised-domain-adaptation-via-4","slug":"unsupervised-domain-adaptation-via-4","title":"Unsupervised Domain Adaptation via Structurally Regularized Deep Clustering","date":"2020-03-19","arxiv_id":"2003.08607","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-domain-adaptation-via-4#ran","syntology_url":"https://syntology.ai/paper/2003.08607","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.08607"}},"official":{"repos":["huitangtang/SRDC-CVPR2020"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/a-survey-of-adversarial-learning-on-graphs","slug":"a-survey-of-adversarial-learning-on-graphs","title":"A Survey of Adversarial Learning on Graphs","date":"2020-03-10","arxiv_id":"2003.05730","repositories_listed":2,"syntology":null},{"url":"/paper/an-api-oriented-open-source-python-framework-1","slug":"an-api-oriented-open-source-python-framework-1","title":"Karate Club: An API Oriented Open-source Python Framework for Unsupervised Learning on Graphs","date":"2020-03-10","arxiv_id":"2003.04819","repositories_listed":2,"syntology":null},{"url":"/paper/embedding-expansion-augmentation-in-embedding","slug":"embedding-expansion-augmentation-in-embedding","title":"Embedding Expansion: Augmentation in Embedding Space for Deep Metric Learning","date":"2020-03-05","arxiv_id":"2003.02546","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/embedding-expansion-augmentation-in-embedding#ran","syntology_url":"https://syntology.ai/paper/2003.02546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02546"}},"official":{"repos":["clovaai/embedding-expansion"],"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":["listed","official"]}}},{"url":"/paper/binarized-pmi-matrix-bridging-word-embeddings","slug":"binarized-pmi-matrix-bridging-word-embeddings","title":"Squashed Shifted PMI Matrix: Bridging Word Embeddings and Hyperbolic Spaces","date":"2020-02-27","arxiv_id":"2002.12005","repositories_listed":2,"syntology":null},{"url":"/paper/robustperiod-time-frequency-mining-for-robust","slug":"robustperiod-time-frequency-mining-for-robust","title":"RobustPeriod: Time-Frequency Mining for Robust Multiple Periodicity Detection","date":"2020-02-21","arxiv_id":"2002.09535","repositories_listed":2,"syntology":null},{"url":"/paper/distributed-bayesian-matrix-decomposition-for","slug":"distributed-bayesian-matrix-decomposition-for","title":"Distributed Bayesian Matrix Decomposition for Big Data Mining and Clustering","date":"2020-02-10","arxiv_id":"2002.03703","repositories_listed":2,"syntology":null},{"url":"/paper/k-bmom-a-robust-lloyd-type-clustering","slug":"k-bmom-a-robust-lloyd-type-clustering","title":"K-bMOM: a robust Lloyd-type clustering algorithm based on bootstrap Median-of-Means","date":"2020-02-10","arxiv_id":"2002.03899","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/k-bmom-a-robust-lloyd-type-clustering#ran","syntology_url":"https://syntology.ai/paper/2002.03899","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03899"}},"official":{"repos":["csaumard/kbMOM"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/magnn-metapath-aggregated-graph-neural","slug":"magnn-metapath-aggregated-graph-neural","title":"MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding","date":"2020-02-05","arxiv_id":"2002.01680","repositories_listed":2,"syntology":null},{"url":"/paper/structural-deep-clustering-network","slug":"structural-deep-clustering-network","title":"Structural Deep Clustering Network","date":"2020-02-05","arxiv_id":"2002.01633","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structural-deep-clustering-network#ran","syntology_url":"https://syntology.ai/paper/2002.01633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.01633"}},"official":{"repos":["bdy9527/SDCN"],"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":["listed","official"]}}},{"url":"/paper/deep-image-clustering-with-tensor-kernels-and","slug":"deep-image-clustering-with-tensor-kernels-and","title":"Leveraging tensor kernels to reduce objective function mismatch in deep clustering","date":"2020-01-20","arxiv_id":"2001.07026","repositories_listed":2,"syntology":null},{"url":"/paper/graph-bert-only-attention-is-needed-for","slug":"graph-bert-only-attention-is-needed-for","title":"Graph-Bert: Only Attention is Needed for Learning Graph Representations","date":"2020-01-15","arxiv_id":"2001.05140","repositories_listed":2,"syntology":null},{"url":"/paper/mutual-mean-teaching-pseudo-label-refinery-1","slug":"mutual-mean-teaching-pseudo-label-refinery-1","title":"Mutual Mean-Teaching: Pseudo Label Refinery for Unsupervised Domain Adaptation on Person Re-identification","date":"2020-01-06","arxiv_id":"2001.01526","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":2,"n_ran_checked":2,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mutual-mean-teaching-pseudo-label-refinery-1#ran","syntology_url":"https://syntology.ai/paper/2001.01526","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.01526"}},"official":{"repos":["yxgeee/MMT"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/spectral-embedding-of-regularized-block-1","slug":"spectral-embedding-of-regularized-block-1","title":"Spectral embedding of regularized block models","date":"2019-12-23","arxiv_id":"1912.10903","repositories_listed":2,"syntology":null},{"url":"/paper/unsupervised-representation-learning-by-6","slug":"unsupervised-representation-learning-by-6","title":"Unsupervised Representation Learning by Predicting Random Distances","date":"2019-12-22","arxiv_id":"1912.12186","repositories_listed":2,"syntology":null},{"url":"/paper/191209654","slug":"191209654","title":"JSNet: Joint Instance and Semantic Segmentation of 3D Point Clouds","date":"2019-12-20","arxiv_id":"1912.09654","repositories_listed":2,"syntology":null},{"url":"/paper/learning-representations-for-time-series","slug":"learning-representations-for-time-series","title":"Learning Representations for Time Series Clustering","date":"2019-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/the-group-loss-for-deep-metric-learning","slug":"the-group-loss-for-deep-metric-learning","title":"The Group Loss for Deep Metric Learning","date":"2019-12-01","arxiv_id":"1912.00385","repositories_listed":2,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/the-group-loss-for-deep-metric-learning#ran","syntology_url":"https://syntology.ai/paper/1912.00385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.00385"}},"official":{"repos":["dvl-tum/group_loss"],"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":["listed","official"]}}},{"url":"/paper/large-scale-multi-view-subspace-clustering-in","slug":"large-scale-multi-view-subspace-clustering-in","title":"Large-scale Multi-view Subspace Clustering in Linear Time","date":"2019-11-21","arxiv_id":"1911.09290","repositories_listed":2,"syntology":null},{"url":"/paper/domain-generalization-using-a-mixture-of","slug":"domain-generalization-using-a-mixture-of","title":"Domain Generalization Using a Mixture of Multiple Latent Domains","date":"2019-11-18","arxiv_id":"1911.07661","repositories_listed":2,"syntology":null},{"url":"/paper/deep-learning-for-clustering-of-multivariate","slug":"deep-learning-for-clustering-of-multivariate","title":"Deep learning for clustering of multivariate clinical patient trajectories with missing values","date":"2019-11-15","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/rationally-inattentive-inverse-reinforcement","slug":"rationally-inattentive-inverse-reinforcement","title":"Rationally Inattentive Inverse Reinforcement Learning Explains YouTube Commenting Behavior","date":"2019-10-24","arxiv_id":"1910.11703","repositories_listed":2,"syntology":null},{"url":"/paper/a-maximum-likelihood-approach-to-extract","slug":"a-maximum-likelihood-approach-to-extract","title":"A Maximum Likelihood Approach to Extract Finite Planes from 3-D Laser Scans","date":"2019-10-23","arxiv_id":"1910.11146","repositories_listed":2,"syntology":null},{"url":"/paper/sampling-random-graph-homomorphisms-and","slug":"sampling-random-graph-homomorphisms-and","title":"Sampling random graph homomorphisms and applications to network data analysis","date":"2019-10-21","arxiv_id":"1910.09483","repositories_listed":2,"syntology":null},{"url":"/paper/let-sne-a-hybrid-approach-to-data-embedding","slug":"let-sne-a-hybrid-approach-to-data-embedding","title":"LEt-SNE: A Hybrid Approach To Data Embedding and Visualization of Hyperspectral Imagery","date":"2019-10-19","arxiv_id":"1910.08790","repositories_listed":2,"syntology":null},{"url":"/paper/a-novel-centroid-update-approach-for","slug":"a-novel-centroid-update-approach-for","title":"A novel centroid update approach for clustering-based superpixel methods and superpixel-based edge detection","date":"2019-10-18","arxiv_id":"1910.08439","repositories_listed":2,"syntology":null},{"url":"/paper/mapper-based-classifier","slug":"mapper-based-classifier","title":"Mapper Based Classifier","date":"2019-10-17","arxiv_id":"1910.08103","repositories_listed":2,"syntology":null},{"url":"/paper/unsupervised-discovery-of-sparse-multimodal","slug":"unsupervised-discovery-of-sparse-multimodal","title":"Discovering a sparse set of pairwise discriminating features in high dimensional data","date":"2019-10-13","arxiv_id":"1910.05814","repositories_listed":2,"syntology":null},{"url":"/paper/learning-invariant-representations-of-social","slug":"learning-invariant-representations-of-social","title":"Learning Invariant Representations of Social Media Users","date":"2019-10-11","arxiv_id":"1910.04979","repositories_listed":2,"syntology":null},{"url":"/paper/clustered-federated-learning-model-agnostic","slug":"clustered-federated-learning-model-agnostic","title":"Clustered Federated Learning: Model-Agnostic Distributed Multi-Task Optimization under Privacy Constraints","date":"2019-10-04","arxiv_id":"1910.01991","repositories_listed":2,"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/clustered-federated-learning-model-agnostic#ran","syntology_url":"https://syntology.ai/paper/1910.01991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01991"}},"official":null}},{"url":"/paper/variational-psom-deep-probabilistic","slug":"variational-psom-deep-probabilistic","title":"DPSOM: Deep Probabilistic Clustering with Self-Organizing Maps","date":"2019-10-03","arxiv_id":"1910.01590","repositories_listed":2,"syntology":null},{"url":"/paper/quantum-graph-neural-networks-1","slug":"quantum-graph-neural-networks-1","title":"Quantum Graph Neural Networks","date":"2019-09-26","arxiv_id":"1909.12264","repositories_listed":2,"syntology":null},{"url":"/paper/end-to-end-neural-speaker-diarization-with","slug":"end-to-end-neural-speaker-diarization-with","title":"End-to-End Neural Speaker Diarization with Self-attention","date":"2019-09-13","arxiv_id":"1909.06247","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/end-to-end-neural-speaker-diarization-with#ran","syntology_url":"https://syntology.ai/paper/1909.06247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.06247"}},"official":{"repos":["hitachi-speech/EEND"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/giveme5w1h-a-universal-system-for-extracting","slug":"giveme5w1h-a-universal-system-for-extracting","title":"Giveme5W1H: A Universal System for Extracting Main Events from News Articles","date":"2019-09-06","arxiv_id":"1909.02766","repositories_listed":2,"syntology":null},{"url":"/paper/an-empirical-comparison-between-stochastic","slug":"an-empirical-comparison-between-stochastic","title":"An empirical comparison between stochastic and deterministic centroid initialisation for K-Means variations","date":"2019-08-26","arxiv_id":"1908.09946","repositories_listed":2,"syntology":null},{"url":"/paper/gan-tree-an-incrementally-learned","slug":"gan-tree-an-incrementally-learned","title":"GAN-Tree: An Incrementally Learned Hierarchical Generative Framework for Multi-Modal Data Distributions","date":"2019-08-11","arxiv_id":"1908.03919","repositories_listed":2,"syntology":null},{"url":"/paper/multi-view-deep-subspace-clustering-networks","slug":"multi-view-deep-subspace-clustering-networks","title":"Multi-view Deep Subspace Clustering Networks","date":"2019-08-06","arxiv_id":"1908.01978","repositories_listed":2,"syntology":null},{"url":"/paper/sequence-level-semantics-aggregation-for","slug":"sequence-level-semantics-aggregation-for","title":"Sequence Level Semantics Aggregation for Video Object Detection","date":"2019-07-15","arxiv_id":"1907.06390","repositories_listed":2,"syntology":null},{"url":"/paper/a-flexible-em-like-clustering-algorithm-for","slug":"a-flexible-em-like-clustering-algorithm-for","title":"A flexible EM-like clustering algorithm for noisy data","date":"2019-07-02","arxiv_id":"1907.01660","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-flexible-em-like-clustering-algorithm-for#ran","syntology_url":"https://syntology.ai/paper/1907.01660","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.01660"}},"official":{"repos":["violetr/fem"],"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":["listed","official"]}}},{"url":"/paper/lane-detection-and-classification-using","slug":"lane-detection-and-classification-using","title":"Lane Detection and Classification using Cascaded CNNs","date":"2019-07-02","arxiv_id":"1907.01294","repositories_listed":2,"syntology":null},{"url":"/paper/latent-optimization-for-non-adversarial","slug":"latent-optimization-for-non-adversarial","title":"Demystifying Inter-Class Disentanglement","date":"2019-06-27","arxiv_id":"1906.11796","repositories_listed":2,"syntology":null},{"url":"/paper/classification-and-clustering-of-arguments","slug":"classification-and-clustering-of-arguments","title":"Classification and Clustering of Arguments with Contextualized Word Embeddings","date":"2019-06-24","arxiv_id":"1906.09821","repositories_listed":2,"syntology":null},{"url":"/paper/clustering-with-fairness-constraints-a","slug":"clustering-with-fairness-constraints-a","title":"Variational Fair Clustering","date":"2019-06-19","arxiv_id":"1906.08207","repositories_listed":2,"syntology":null},{"url":"/paper/towards-better-substitution-based-word-sense","slug":"towards-better-substitution-based-word-sense","title":"Towards better substitution-based word sense induction","date":"2019-05-29","arxiv_id":"1905.12598","repositories_listed":2,"syntology":null},{"url":"/paper/learning-bregman-divergences","slug":"learning-bregman-divergences","title":"Learning to Approximate a Bregman Divergence","date":"2019-05-28","arxiv_id":"1905.11545","repositories_listed":2,"syntology":null},{"url":"/paper/esa-entity-summarization-with-attention","slug":"esa-entity-summarization-with-attention","title":"ESA: Entity Summarization with Attention","date":"2019-05-25","arxiv_id":"1905.10625","repositories_listed":2,"syntology":null},{"url":"/paper/multi-view-information-theoretic-co","slug":"multi-view-information-theoretic-co","title":"Multi-view Information-theoretic Co-clustering for Co-occurrence Data","date":"2019-05-25","arxiv_id":"1905.10594","repositories_listed":2,"syntology":null},{"url":"/paper/correlated-variational-auto-encoders","slug":"correlated-variational-auto-encoders","title":"Correlated Variational Auto-Encoders","date":"2019-05-14","arxiv_id":"1905.05335","repositories_listed":2,"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/correlated-variational-auto-encoders#ran","syntology_url":"https://syntology.ai/paper/1905.05335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05335"}},"official":{"repos":["datang1992/Correlated-VAEs"],"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/a-review-of-keyphrase-extraction","slug":"a-review-of-keyphrase-extraction","title":"A Review of Keyphrase Extraction","date":"2019-05-13","arxiv_id":"1905.05044","repositories_listed":2,"syntology":null},{"url":"/paper/feature-selection-and-feature-extraction-in","slug":"feature-selection-and-feature-extraction-in","title":"Feature Selection and Feature Extraction in Pattern Analysis: A Literature Review","date":"2019-05-07","arxiv_id":"1905.02845","repositories_listed":2,"syntology":null},{"url":"/paper/leveraging-large-scale-uncurated-data-for","slug":"leveraging-large-scale-uncurated-data-for","title":"Unsupervised Pre-Training of Image Features on Non-Curated Data","date":"2019-05-03","arxiv_id":"1905.01278","repositories_listed":2,"syntology":null},{"url":"/paper/sosnet-second-order-similarity-regularization","slug":"sosnet-second-order-similarity-regularization","title":"SOSNet: Second Order Similarity Regularization for Local Descriptor Learning","date":"2019-04-10","arxiv_id":"1904.05019","repositories_listed":2,"syntology":null},{"url":"/paper/pyramid-mask-text-detector","slug":"pyramid-mask-text-detector","title":"Pyramid Mask Text Detector","date":"2019-03-28","arxiv_id":"1903.11800","repositories_listed":2,"syntology":null},{"url":"/paper/ensemble-clustering-for-graphs-comparisons","slug":"ensemble-clustering-for-graphs-comparisons","title":"Ensemble Clustering for Graphs: Comparisons and Applications","date":"2019-03-19","arxiv_id":"1903.08012","repositories_listed":2,"syntology":null},{"url":"/paper/a-clustering-based-combinatorial-approach-to","slug":"a-clustering-based-combinatorial-approach-to","title":"A Clustering-Based Combinatorial Approach to Unsupervised Matching of Product Titles","date":"2019-03-07","arxiv_id":"1903.04276","repositories_listed":2,"syntology":null},{"url":"/paper/humor-in-word-embeddings-cockamamie","slug":"humor-in-word-embeddings-cockamamie","title":"Humor in Word Embeddings: Cockamamie Gobbledegook for Nincompoops","date":"2019-02-08","arxiv_id":"1902.02783","repositories_listed":2,"syntology":null},{"url":"/paper/combined-tract-segmentation-and-orientation","slug":"combined-tract-segmentation-and-orientation","title":"Combined tract segmentation and orientation mapping for bundle-specific tractography","date":"2019-01-29","arxiv_id":"1901.10271","repositories_listed":2,"syntology":null},{"url":"/paper/are-clusterings-of-multiple-data-views","slug":"are-clusterings-of-multiple-data-views","title":"Are Clusterings of Multiple Data Views Independent?","date":"2019-01-12","arxiv_id":"1901.03905","repositories_listed":2,"syntology":null},{"url":"/paper/robust-graph-learning-from-noisy-data","slug":"robust-graph-learning-from-noisy-data","title":"Robust Graph Learning from Noisy Data","date":"2018-12-17","arxiv_id":"1812.06673","repositories_listed":2,"syntology":null},{"url":"/paper/kernel-treelets","slug":"kernel-treelets","title":"Kernel Treelets","date":"2018-12-12","arxiv_id":"1812.04808","repositories_listed":2,"syntology":null},{"url":"/paper/the-global-anchor-method-for-quantifying","slug":"the-global-anchor-method-for-quantifying","title":"The Global Anchor Method for Quantifying Linguistic Shifts and Domain Adaptation","date":"2018-12-12","arxiv_id":"1812.10382","repositories_listed":2,"syntology":null},{"url":"/paper/q-means-a-quantum-algorithm-for-unsupervised","slug":"q-means-a-quantum-algorithm-for-unsupervised","title":"q-means: A quantum algorithm for unsupervised machine learning","date":"2018-12-10","arxiv_id":"1812.03584","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/q-means-a-quantum-algorithm-for-unsupervised#ran","syntology_url":"https://syntology.ai/paper/1812.03584","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.03584"}},"official":{"repos":["JonasLandman/quantum_kmeans_NeurIPS_2019"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/unsupervised-learning-and-data-clustering-for","slug":"unsupervised-learning-and-data-clustering-for","title":"Deep Learning at Scale for the Construction of Galaxy Catalogs in the Dark Energy Survey","date":"2018-12-05","arxiv_id":"1812.02183","repositories_listed":2,"syntology":null},{"url":"/paper/xnet-a-convolutional-neural-network-cnn","slug":"xnet-a-convolutional-neural-network-cnn","title":"XNet: A convolutional neural network (CNN) implementation for medical X-Ray image segmentation suitable for small datasets","date":"2018-12-03","arxiv_id":"1812.00548","repositories_listed":2,"syntology":null},{"url":"/paper/making-classification-competitive-for-deep","slug":"making-classification-competitive-for-deep","title":"Classification is a Strong Baseline for Deep Metric Learning","date":"2018-11-30","arxiv_id":"1811.12649","repositories_listed":2,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/making-classification-competitive-for-deep#ran","syntology_url":"https://syntology.ai/paper/1811.12649","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.12649"}},"official":{"repos":["azgo14/classification_metric_learning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/enhanced-network-embedding-with-text","slug":"enhanced-network-embedding-with-text","title":"Enhanced Network Embedding with Text Information","date":"2018-11-29","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/spectral-feature-transformation-for-person-re","slug":"spectral-feature-transformation-for-person-re","title":"Spectral Feature Transformation for Person Re-identification","date":"2018-11-28","arxiv_id":"1811.11405","repositories_listed":2,"syntology":null},{"url":"/paper/accurate-efficient-and-scalable-graph","slug":"accurate-efficient-and-scalable-graph","title":"Accurate, Efficient and Scalable Graph Embedding","date":"2018-10-28","arxiv_id":"1810.11899","repositories_listed":2,"syntology":null},{"url":"/paper/an-introduction-to-fast-super-paramagnetic","slug":"an-introduction-to-fast-super-paramagnetic","title":"Fast Super-Paramagnetic Clustering","date":"2018-10-05","arxiv_id":"1810.02529","repositories_listed":2,"syntology":null},{"url":"/paper/an-online-algorithm-for-constrained-face","slug":"an-online-algorithm-for-constrained-face","title":"AN ONLINE ALGORITHM FOR CONSTRAINED FACE CLUSTERING IN VIDEOS","date":"2018-09-06","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/multilingual-clustering-of-streaming-news","slug":"multilingual-clustering-of-streaming-news","title":"Multilingual Clustering of Streaming News","date":"2018-09-03","arxiv_id":"1809.00540","repositories_listed":2,"syntology":null},{"url":"/paper/watset-local-global-graph-clustering-with","slug":"watset-local-global-graph-clustering-with","title":"Watset: Local-Global Graph Clustering with Applications in Sense and Frame Induction","date":"2018-08-20","arxiv_id":"1808.06696","repositories_listed":2,"syntology":null},{"url":"/paper/variational-wasserstein-clustering","slug":"variational-wasserstein-clustering","title":"Variational Wasserstein Clustering","date":"2018-06-23","arxiv_id":"1806.09045","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/variational-wasserstein-clustering#ran","syntology_url":"https://syntology.ai/paper/1806.09045","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.09045"}},"official":{"repos":["icemiliang/vot"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/tract-orientation-mapping-for-bundle-specific","slug":"tract-orientation-mapping-for-bundle-specific","title":"Tract orientation mapping for bundle-specific tractography","date":"2018-06-14","arxiv_id":"1806.05580","repositories_listed":2,"syntology":null},{"url":"/paper/efficient-certifiably-optimal-clustering-with","slug":"efficient-certifiably-optimal-clustering-with","title":"Efficient, Certifiably Optimal Clustering with Applications to Latent Variable Graphical Models","date":"2018-06-01","arxiv_id":"1806.00530","repositories_listed":2,"syntology":null},{"url":"/paper/optimal-transport-for-structured-data-with","slug":"optimal-transport-for-structured-data-with","title":"Optimal Transport for structured data with application on graphs","date":"2018-05-23","arxiv_id":"1805.09114","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimal-transport-for-structured-data-with#ran","syntology_url":"https://syntology.ai/paper/1805.09114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09114"}},"official":null}},{"url":"/paper/high-dimensional-estimation-and-multi-factor","slug":"high-dimensional-estimation-and-multi-factor","title":"High-Dimensional Estimation, Basis Assets, and the Adaptive Multi-Factor Model","date":"2018-04-23","arxiv_id":"1804.08472","repositories_listed":2,"syntology":null},{"url":"/paper/fusing-structure-and-content-via-non-negative","slug":"fusing-structure-and-content-via-non-negative","title":"Fusing Structure and Content via Non-negative Matrix Factorization for Embedding Information Networks","date":"2018-04-15","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/clustering-analysis-on-locally-asymptotically","slug":"clustering-analysis-on-locally-asymptotically","title":"Cluster Analysis on Locally Asymptotically Self-similar Processes with Known Number of Clusters","date":"2018-04-13","arxiv_id":"1804.06234","repositories_listed":2,"syntology":null},{"url":"/paper/understanding-humans-in-crowded-scenes-deep","slug":"understanding-humans-in-crowded-scenes-deep","title":"Understanding Humans in Crowded Scenes: Deep Nested Adversarial Learning and A New Benchmark for Multi-Human Parsing","date":"2018-04-10","arxiv_id":"1804.03287","repositories_listed":2,"syntology":null},{"url":"/paper/text-segmentation-as-a-supervised-learning","slug":"text-segmentation-as-a-supervised-learning","title":"Text Segmentation as a Supervised Learning Task","date":"2018-03-25","arxiv_id":"1803.09337","repositories_listed":2,"syntology":null},{"url":"/paper/fast-sequence-based-embedding-with-diffusion","slug":"fast-sequence-based-embedding-with-diffusion","title":"Fast Sequence Based Embedding with Diffusion Graphs","date":"2018-03-20","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/automatic-topography-of-high-dimensional-data","slug":"automatic-topography-of-high-dimensional-data","title":"Automatic topography of high-dimensional data sets by non-parametric Density Peak clustering","date":"2018-02-28","arxiv_id":"1802.10549","repositories_listed":2,"syntology":null},{"url":"/paper/fair-clustering-through-fairlets","slug":"fair-clustering-through-fairlets","title":"Fair Clustering Through Fairlets","date":"2018-02-15","arxiv_id":"1802.05733","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":2,"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, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fair-clustering-through-fairlets#ran","syntology_url":"https://syntology.ai/paper/1802.05733","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.05733"}},"official":null}},{"url":"/paper/convex-formulations-for-fair-principal","slug":"convex-formulations-for-fair-principal","title":"Convex Formulations for Fair Principal Component Analysis","date":"2018-02-11","arxiv_id":"1802.03765","repositories_listed":2,"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/convex-formulations-for-fair-principal#ran","syntology_url":"https://syntology.ai/paper/1802.03765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.03765"}},"official":{"repos":["molfat66/FairML"],"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/a-two-stage-method-for-text-line-detection-in","slug":"a-two-stage-method-for-text-line-detection-in","title":"A Two-Stage Method for Text Line Detection in Historical Documents","date":"2018-02-09","arxiv_id":"1802.03345","repositories_listed":2,"syntology":null},{"url":"/paper/clustering-with-deep-learning-taxonomy-and","slug":"clustering-with-deep-learning-taxonomy-and","title":"Clustering with Deep Learning: Taxonomy and New Methods","date":"2018-01-23","arxiv_id":"1801.07648","repositories_listed":2,"syntology":null},{"url":"/paper/recurrent-pixel-embedding-for-instance","slug":"recurrent-pixel-embedding-for-instance","title":"Recurrent Pixel Embedding for Instance Grouping","date":"2017-12-22","arxiv_id":"1712.08273","repositories_listed":2,"syntology":null},{"url":"/paper/transform-invariant-non-parametric-clustering","slug":"transform-invariant-non-parametric-clustering","title":"Transform-Invariant Non-Parametric Clustering of Covariance Matrices and its Application to Unsupervised Joint Segmentation and Action Discovery","date":"2017-10-27","arxiv_id":"1710.10060","repositories_listed":2,"syntology":null},{"url":"/paper/tracking-persons-of-interest-via-unsupervised","slug":"tracking-persons-of-interest-via-unsupervised","title":"Tracking Persons-of-Interest via Unsupervised Representation Adaptation","date":"2017-10-05","arxiv_id":"1710.02139","repositories_listed":2,"syntology":null},{"url":"/paper/depression-scale-recognition-from-audio","slug":"depression-scale-recognition-from-audio","title":"Depression Scale Recognition from Audio, Visual and Text Analysis","date":"2017-09-18","arxiv_id":"1709.05865","repositories_listed":2,"syntology":null},{"url":"/paper/multi-view-low-rank-sparse-subspace","slug":"multi-view-low-rank-sparse-subspace","title":"Multi-view Low-rank Sparse Subspace Clustering","date":"2017-08-29","arxiv_id":"1708.08732","repositories_listed":2,"syntology":null},{"url":"/paper/discovering-political-topics-in-facebook","slug":"discovering-political-topics-in-facebook","title":"Discovering Political Topics in Facebook Discussion threads with Graph Contextualization","date":"2017-08-23","arxiv_id":"1708.06872","repositories_listed":2,"syntology":null},{"url":"/paper/ego-splitting-framework-from-non-overlapping","slug":"ego-splitting-framework-from-non-overlapping","title":"Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters","date":"2017-08-13","arxiv_id":null,"repositories_listed":2,"syntology":null}],"record_sha256":"f14fa1969c3897dd1d7e64d6f742df7ebeb7e10a7add3a33143dac04f009061b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}