{"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","name":"Clustering","slug":"clustering","description_markdown":"Clustering is the task of grouping unlabeled data point into disjoint subsets. Each data point is labeled with a single class. The number of classes is not known a priori. The grouping criteria is typically based on the similarity of data points to each other.","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":10718,"papers_with_code":2823,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":5,"subtasks":2,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/timit","name":"TIMIT","full_name":"TIMIT Acoustic-Phonetic Continuous Speech Corpus","num_papers_in_archive":31},{"url":"/dataset/daily-and-sports-activities","name":"Daily and Sports Activities","full_name":"","num_papers_in_archive":1},{"url":"/dataset/furit360","name":"Furit360","full_name":"","num_papers_in_archive":1},{"url":"/dataset/mapreader-data","name":"MapReader Data","full_name":"in GeoHumanities workshop, SIGSPATIAL 2022","num_papers_in_archive":1},{"url":"/dataset/audiosim","name":"VocSim","full_name":"Vocal Similarity Benchmark","num_papers_in_archive":0}],"subtasks":[{"url":"/task/categorical-data-clustering","name":"Categorical data clustering"},{"url":"/task/constrained-clustering","name":"Constrained Clustering"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":108,"rows_per_page":100,"shown":100,"of":10718,"of_with_code":2823,"tagged_in_all":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":328,"every_run_a_failure_of_syntologys_instrument":91,"listed_with_a_run_with_no_instrument_failure":328,"listed_every_run_a_failure_of_syntologys_instrument":91,"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"},"items":[{"url":"/paper/facenet-a-unified-embedding-for-face","slug":"facenet-a-unified-embedding-for-face","title":"FaceNet: A Unified Embedding for Face Recognition and Clustering","date":"2015-03-12","arxiv_id":"1503.03832","repositories_listed":183,"syntology":{"n":154,"n_ran":99,"n_constructed":19,"n_ran_checked":83,"n_instrument":16,"n_unverified":55,"n_honours":11,"n_violates":11,"n_no_contract":61,"n_pointer_only":50,"phrase":"99 ran (of which 19 constructed an object rather than computing a result; 83 with no instrument failure: 11 honoured, 11 violated, 61 with no contract checked; 16 where Syntology's instrument failed) · 55 unverified","sample_list":"/paper/facenet-a-unified-embedding-for-face#ran","syntology_url":"https://syntology.ai/paper/1503.03832","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1503.03832"}},"official":null}},{"url":"/paper/sentence-bert-sentence-embeddings-using","slug":"sentence-bert-sentence-embeddings-using","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","date":"2019-08-27","arxiv_id":"1908.10084","repositories_listed":64,"syntology":{"n":58,"n_ran":33,"n_constructed":9,"n_ran_checked":30,"n_instrument":3,"n_unverified":25,"n_honours":1,"n_violates":0,"n_no_contract":29,"n_pointer_only":11,"phrase":"33 ran (of which 9 constructed an object rather than computing a result; 30 with no instrument failure: 1 honoured, 0 violated, 29 with no contract checked; 3 where Syntology's instrument failed) · 25 unverified","sample_list":"/paper/sentence-bert-sentence-embeddings-using#ran","syntology_url":"https://syntology.ai/paper/1908.10084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.10084"}},"official":{"repos":["UKPLab/sentence-transformers"],"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/adversarial-autoencoders","slug":"adversarial-autoencoders","title":"Adversarial Autoencoders","date":"2015-11-18","arxiv_id":"1511.05644","repositories_listed":29,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":3,"n_honours":3,"n_violates":1,"n_no_contract":1,"n_pointer_only":9,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 3 honoured, 1 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adversarial-autoencoders#ran","syntology_url":"https://syntology.ai/paper/1511.05644","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.05644"}},"official":null}},{"url":"/paper/xgboost-a-scalable-tree-boosting-system","slug":"xgboost-a-scalable-tree-boosting-system","title":"XGBoost: A Scalable Tree Boosting System","date":"2016-03-09","arxiv_id":"1603.02754","repositories_listed":28,"syntology":{"n":17,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/xgboost-a-scalable-tree-boosting-system#ran","syntology_url":"https://syntology.ai/paper/1603.02754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.02754"}},"official":{"repos":["dmlc/xgboost"],"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/solo-segmenting-objects-by-locations","slug":"solo-segmenting-objects-by-locations","title":"SOLO: Segmenting Objects by Locations","date":"2019-12-10","arxiv_id":"1912.04488","repositories_listed":24,"syntology":null},{"url":"/paper/unsupervised-deep-embedding-for-clustering","slug":"unsupervised-deep-embedding-for-clustering","title":"Unsupervised Deep Embedding for Clustering Analysis","date":"2015-11-19","arxiv_id":"1511.06335","repositories_listed":23,"syntology":{"n":25,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":12,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":3,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/unsupervised-deep-embedding-for-clustering#ran","syntology_url":"https://syntology.ai/paper/1511.06335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06335"}},"official":{"repos":["piiswrong/dec"],"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":["listed","official"]}}},{"url":"/paper/deep-speaker-an-end-to-end-neural-speaker","slug":"deep-speaker-an-end-to-end-neural-speaker","title":"Deep Speaker: an End-to-End Neural Speaker Embedding System","date":"2017-05-05","arxiv_id":"1705.02304","repositories_listed":15,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-speaker-an-end-to-end-neural-speaker#ran","syntology_url":"https://syntology.ai/paper/1705.02304","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.02304"}},"official":null}},{"url":"/paper/hubert-self-supervised-speech-representation","slug":"hubert-self-supervised-speech-representation","title":"HuBERT: Self-Supervised Speech Representation Learning by Masked Prediction of Hidden Units","date":"2021-06-14","arxiv_id":"2106.07447","repositories_listed":11,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/hubert-self-supervised-speech-representation#ran","syntology_url":"https://syntology.ai/paper/2106.07447","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07447"}},"official":{"repos":["pytorch/fairseq","huggingface/transformers"],"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/variational-deep-embedding-an-unsupervised","slug":"variational-deep-embedding-an-unsupervised","title":"Variational Deep Embedding: An Unsupervised and Generative Approach to Clustering","date":"2016-11-16","arxiv_id":"1611.05148","repositories_listed":11,"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":2,"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-deep-embedding-an-unsupervised#ran","syntology_url":"https://syntology.ai/paper/1611.05148","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.05148"}},"official":{"repos":["slim1017/VaDE"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/towards-k-means-friendly-spaces-simultaneous","slug":"towards-k-means-friendly-spaces-simultaneous","title":"Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clustering","date":"2016-10-15","arxiv_id":"1610.04794","repositories_listed":11,"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":1,"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/towards-k-means-friendly-spaces-simultaneous#ran","syntology_url":"https://syntology.ai/paper/1610.04794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.04794"}},"official":{"repos":["boyangumn/DCN"],"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/key-points-estimation-and-point-instance","slug":"key-points-estimation-and-point-instance","title":"Key Points Estimation and Point Instance Segmentation Approach for Lane Detection","date":"2020-02-16","arxiv_id":"2002.06604","repositories_listed":10,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/key-points-estimation-and-point-instance#ran","syntology_url":"https://syntology.ai/paper/2002.06604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06604"}},"official":{"repos":["koyeongmin/PINet","koyeongmin/PINet_new"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/catboost-unbiased-boosting-with-categorical","slug":"catboost-unbiased-boosting-with-categorical","title":"CatBoost: unbiased boosting with categorical features","date":"2017-06-28","arxiv_id":"1706.09516","repositories_listed":10,"syntology":null},{"url":"/paper/deep-clustering-for-unsupervised-learning-of","slug":"deep-clustering-for-unsupervised-learning-of","title":"Deep Clustering for Unsupervised Learning of Visual Features","date":"2018-07-15","arxiv_id":"1807.05520","repositories_listed":9,"syntology":{"n":7,"n_ran":5,"n_constructed":2,"n_ran_checked":3,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-clustering-for-unsupervised-learning-of#ran","syntology_url":"https://syntology.ai/paper/1807.05520","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.05520"}},"official":{"repos":["facebookresearch/deepcluster"],"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/leveraging-bert-for-extractive-text","slug":"leveraging-bert-for-extractive-text","title":"Leveraging BERT for Extractive Text Summarization on Lectures","date":"2019-06-07","arxiv_id":"1906.04165","repositories_listed":8,"syntology":null},{"url":"/paper/entity-embeddings-of-categorical-variables","slug":"entity-embeddings-of-categorical-variables","title":"Entity Embeddings of Categorical Variables","date":"2016-04-22","arxiv_id":"1604.06737","repositories_listed":8,"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":2,"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/entity-embeddings-of-categorical-variables#ran","syntology_url":"https://syntology.ai/paper/1604.06737","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1604.06737"}},"official":{"repos":["entron/entity-embedding-rossmann"],"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/deep-clustering-discriminative-embeddings-for","slug":"deep-clustering-discriminative-embeddings-for","title":"Deep clustering: Discriminative embeddings for segmentation and separation","date":"2015-08-18","arxiv_id":"1508.04306","repositories_listed":8,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-clustering-discriminative-embeddings-for#ran","syntology_url":"https://syntology.ai/paper/1508.04306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1508.04306"}},"official":null}},{"url":"/paper/decaf-a-deep-convolutional-activation-feature","slug":"decaf-a-deep-convolutional-activation-feature","title":"DeCAF: A Deep Convolutional Activation Feature for Generic Visual Recognition","date":"2013-10-06","arxiv_id":"1310.1531","repositories_listed":8,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/decaf-a-deep-convolutional-activation-feature#ran","syntology_url":"https://syntology.ai/paper/1310.1531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1310.1531"}},"official":null}},{"url":"/paper/clustergan-latent-space-clustering-in","slug":"clustergan-latent-space-clustering-in","title":"ClusterGAN : Latent Space Clustering in Generative Adversarial Networks","date":"2018-09-10","arxiv_id":"1809.03627","repositories_listed":7,"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/clustergan-latent-space-clustering-in#ran","syntology_url":"https://syntology.ai/paper/1809.03627","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.03627"}},"official":null}},{"url":"/paper/a-high-bias-low-variance-introduction-to","slug":"a-high-bias-low-variance-introduction-to","title":"A high-bias, low-variance introduction to Machine Learning for physicists","date":"2018-03-23","arxiv_id":"1803.08823","repositories_listed":7,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/a-high-bias-low-variance-introduction-to#ran","syntology_url":"https://syntology.ai/paper/1803.08823","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.08823"}},"official":{"repos":["drckf/mlreview_notebooks","alexandreday/fast_density_clustering"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/enhancing-geometric-factors-in-model-learning","slug":"enhancing-geometric-factors-in-model-learning","title":"Enhancing Geometric Factors in Model Learning and Inference for Object Detection and Instance Segmentation","date":"2020-05-07","arxiv_id":"2005.03572","repositories_listed":6,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"2 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/enhancing-geometric-factors-in-model-learning#ran","syntology_url":"https://syntology.ai/paper/2005.03572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.03572"}},"official":{"repos":["Zzh-tju/CIoU"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]}}},{"url":"/paper/agglomerative-fast-super-paramagnetic","slug":"agglomerative-fast-super-paramagnetic","title":"Agglomerative Likelihood Clustering","date":"2019-08-02","arxiv_id":"1908.00951","repositories_listed":6,"syntology":null},{"url":"/paper/cluster-gcn-an-efficient-algorithm-for","slug":"cluster-gcn-an-efficient-algorithm-for","title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","date":"2019-05-20","arxiv_id":"1905.07953","repositories_listed":6,"syntology":null},{"url":"/paper/multi-interest-network-with-dynamic-routing","slug":"multi-interest-network-with-dynamic-routing","title":"Multi-Interest Network with Dynamic Routing for Recommendation at Tmall","date":"2019-04-17","arxiv_id":"1904.08030","repositories_listed":6,"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/multi-interest-network-with-dynamic-routing#ran","syntology_url":"https://syntology.ai/paper/1904.08030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08030"}},"official":null}},{"url":"/paper/invariant-information-distillation-for","slug":"invariant-information-distillation-for","title":"Invariant Information Clustering for Unsupervised Image Classification and Segmentation","date":"2018-07-17","arxiv_id":"1807.06653","repositories_listed":6,"syntology":{"n":18,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/invariant-information-distillation-for#ran","syntology_url":"https://syntology.ai/paper/1807.06653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.06653"}},"official":{"repos":["xu-ji/IIC"],"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":["listed","official"]}}},{"url":"/paper/som-vae-interpretable-discrete-representation","slug":"som-vae-interpretable-discrete-representation","title":"SOM-VAE: Interpretable Discrete Representation Learning on Time Series","date":"2018-06-06","arxiv_id":"1806.02199","repositories_listed":6,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/som-vae-interpretable-discrete-representation#ran","syntology_url":"https://syntology.ai/paper/1806.02199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.02199"}},"official":{"repos":["ratschlab/SOM-VAE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph2vec-learning-distributed","slug":"graph2vec-learning-distributed","title":"graph2vec: Learning Distributed Representations of Graphs","date":"2017-07-17","arxiv_id":"1707.05005","repositories_listed":6,"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":2,"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/graph2vec-learning-distributed#ran","syntology_url":"https://syntology.ai/paper/1707.05005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.05005"}},"official":null}},{"url":"/paper/sampling-matters-in-deep-embedding-learning","slug":"sampling-matters-in-deep-embedding-learning","title":"Sampling Matters in Deep Embedding Learning","date":"2017-06-23","arxiv_id":"1706.07567","repositories_listed":6,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sampling-matters-in-deep-embedding-learning#ran","syntology_url":"https://syntology.ai/paper/1706.07567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.07567"}},"official":null}},{"url":"/paper/qcd-aware-recursive-neural-networks-for-jet","slug":"qcd-aware-recursive-neural-networks-for-jet","title":"QCD-Aware Recursive Neural Networks for Jet Physics","date":"2017-02-02","arxiv_id":"1702.00748","repositories_listed":6,"syntology":{"n":15,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/qcd-aware-recursive-neural-networks-for-jet#ran","syntology_url":"https://syntology.ai/paper/1702.00748","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.00748"}},"official":{"repos":["glouppe/recnn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/pypots-a-python-toolbox-for-data-mining-on","slug":"pypots-a-python-toolbox-for-data-mining-on","title":"PyPOTS: A Python Toolbox for Data Mining on Partially-Observed Time Series","date":"2023-05-30","arxiv_id":"2305.18811","repositories_listed":5,"syntology":{"n":21,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/pypots-a-python-toolbox-for-data-mining-on#ran","syntology_url":"https://syntology.ai/paper/2305.18811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18811"}},"official":{"repos":["WenjieDu/PyPOTS","wenjiedu/brewpots","WenjieDu/PyGrinder","WenjieDu/TSDB","wenjiedu/awesome_imputation"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/self-labelling-via-simultaneous-clustering-1","slug":"self-labelling-via-simultaneous-clustering-1","title":"Self-labelling via simultaneous clustering and representation learning","date":"2019-11-13","arxiv_id":"1911.05371","repositories_listed":5,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":9,"n_instrument":7,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":6,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/self-labelling-via-simultaneous-clustering-1#ran","syntology_url":"https://syntology.ai/paper/1911.05371","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.05371"}},"official":{"repos":["yukimasano/self-label"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/n2dnot-too-deep-clustering-via-clustering-the","slug":"n2dnot-too-deep-clustering-via-clustering-the","title":"N2D: (Not Too) Deep Clustering via Clustering the Local Manifold of an Autoencoded Embedding","date":"2019-08-16","arxiv_id":"1908.05968","repositories_listed":5,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 2 unverified","sample_list":"/paper/n2dnot-too-deep-clustering-via-clustering-the#ran","syntology_url":"https://syntology.ai/paper/1908.05968","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.05968"}},"official":{"repos":["rymc/n2d"],"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/gratis-generating-time-series-with-diverse","slug":"gratis-generating-time-series-with-diverse","title":"GRATIS: GeneRAting TIme Series with diverse and controllable characteristics","date":"2019-03-07","arxiv_id":"1903.02787","repositories_listed":5,"syntology":null},{"url":"/paper/discrete-neural-processes","slug":"discrete-neural-processes","title":"Neural Clustering Processes","date":"2018-12-28","arxiv_id":"1901.00409","repositories_listed":5,"syntology":null},{"url":"/paper/squeezeseg-convolutional-neural-nets-with","slug":"squeezeseg-convolutional-neural-nets-with","title":"SqueezeSeg: Convolutional Neural Nets with Recurrent CRF for Real-Time Road-Object Segmentation from 3D LiDAR Point Cloud","date":"2017-10-19","arxiv_id":"1710.07368","repositories_listed":5,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/squeezeseg-convolutional-neural-nets-with#ran","syntology_url":"https://syntology.ai/paper/1710.07368","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.07368"}},"official":null}},{"url":"/paper/learnable-pooling-with-context-gating-for","slug":"learnable-pooling-with-context-gating-for","title":"Learnable pooling with Context Gating for video classification","date":"2017-06-21","arxiv_id":"1706.06905","repositories_listed":5,"syntology":null},{"url":"/paper/towards-a-neural-statistician","slug":"towards-a-neural-statistician","title":"Towards a Neural Statistician","date":"2016-06-07","arxiv_id":"1606.02185","repositories_listed":5,"syntology":{"n":14,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":7,"n_honours":1,"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; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/towards-a-neural-statistician#ran","syntology_url":"https://syntology.ai/paper/1606.02185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.02185"}},"official":null}},{"url":"/paper/unsupervised-and-semi-supervised-learning","slug":"unsupervised-and-semi-supervised-learning","title":"Unsupervised and Semi-supervised Learning with Categorical Generative Adversarial Networks","date":"2015-11-19","arxiv_id":"1511.06390","repositories_listed":5,"syntology":null},{"url":"/paper/a-tutorial-on-spectral-clustering","slug":"a-tutorial-on-spectral-clustering","title":"A Tutorial on Spectral Clustering","date":"2007-11-01","arxiv_id":"0711.0189","repositories_listed":5,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-tutorial-on-spectral-clustering#ran","syntology_url":"https://syntology.ai/paper/0711.0189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"0711.0189"}},"official":null}},{"url":"/paper/generating-multidimensional-clusters-with","slug":"generating-multidimensional-clusters-with","title":"Generating Multidimensional Clusters With Support Lines","date":"2023-01-24","arxiv_id":"2301.10327","repositories_listed":4,"syntology":null},{"url":"/paper/expediting-large-scale-vision-transformer-for","slug":"expediting-large-scale-vision-transformer-for","title":"Expediting Large-Scale Vision Transformer for Dense Prediction without Fine-tuning","date":"2022-10-03","arxiv_id":"2210.01035","repositories_listed":4,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/expediting-large-scale-vision-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2210.01035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.01035"}},"official":{"repos":["Expedit-LargeScale-Vision-Transformer/Expedit-DINO","Expedit-LargeScale-Vision-Transformer/Expedit-DPT","Expedit-LargeScale-Vision-Transformer/Expedit-Segmenter"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-framework-for-benchmarking-clustering","slug":"a-framework-for-benchmarking-clustering","title":"A framework for benchmarking clustering algorithms","date":"2022-09-20","arxiv_id":"2209.09493","repositories_listed":4,"syntology":null},{"url":"/paper/learning-discrete-representations-via-1","slug":"learning-discrete-representations-via-1","title":"Learning Discrete Representations via Constrained Clustering for Effective and Efficient Dense Retrieval","date":"2021-10-12","arxiv_id":"2110.05789","repositories_listed":4,"syntology":{"n":22,"n_ran":16,"n_constructed":0,"n_ran_checked":14,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":2,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/learning-discrete-representations-via-1#ran","syntology_url":"https://syntology.ai/paper/2110.05789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.05789"}},"official":{"repos":["jingtaozhan/repconc"],"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/git-clustering-based-on-graph-of-intensity","slug":"git-clustering-based-on-graph-of-intensity","title":"Git: Clustering Based on Graph of Intensity Topology","date":"2021-10-04","arxiv_id":"2110.01274","repositories_listed":4,"syntology":null},{"url":"/paper/cluster-contrast-for-unsupervised-person-re","slug":"cluster-contrast-for-unsupervised-person-re","title":"Cluster Contrast for Unsupervised Person Re-Identification","date":"2021-03-22","arxiv_id":"2103.11568","repositories_listed":4,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":5,"phrase":"10 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; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/cluster-contrast-for-unsupervised-person-re#ran","syntology_url":"https://syntology.ai/paper/2103.11568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.11568"}},"official":{"repos":["alibaba/cluster-contrast","wangguangyuan/ClusterContrast"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/block-model-guided-unsupervised-feature","slug":"block-model-guided-unsupervised-feature","title":"Block Model Guided Unsupervised Feature Selection","date":"2020-07-05","arxiv_id":"2007.02376","repositories_listed":4,"syntology":null},{"url":"/paper/pointgroup-dual-set-point-grouping-for-3d","slug":"pointgroup-dual-set-point-grouping-for-3d","title":"PointGroup: Dual-Set Point Grouping for 3D Instance Segmentation","date":"2020-04-03","arxiv_id":"2004.01658","repositories_listed":4,"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/pointgroup-dual-set-point-grouping-for-3d#ran","syntology_url":"https://syntology.ai/paper/2004.01658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01658"}},"official":null}},{"url":"/paper/fast-sequence-based-embedding-with-diffusion-1","slug":"fast-sequence-based-embedding-with-diffusion-1","title":"Fast Sequence-Based Embedding with Diffusion Graphs","date":"2020-01-21","arxiv_id":"2001.07463","repositories_listed":4,"syntology":null},{"url":"/paper/a-new-burrows-wheeler-transform-markov","slug":"a-new-burrows-wheeler-transform-markov","title":"A New Burrows Wheeler Transform Markov Distance","date":"2019-12-30","arxiv_id":"1912.13046","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-new-burrows-wheeler-transform-markov#ran","syntology_url":"https://syntology.ai/paper/1912.13046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.13046"}},"official":null}},{"url":"/paper/making-ai-forget-you-data-deletion-in-machine","slug":"making-ai-forget-you-data-deletion-in-machine","title":"Making AI Forget You: Data Deletion in Machine Learning","date":"2019-07-11","arxiv_id":"1907.05012","repositories_listed":4,"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":0,"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/making-ai-forget-you-data-deletion-in-machine#ran","syntology_url":"https://syntology.ai/paper/1907.05012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.05012"}},"official":{"repos":["tginart/deletion-efficient-kmeans"],"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/mincut-pooling-in-graph-neural-networks","slug":"mincut-pooling-in-graph-neural-networks","title":"Spectral Clustering with Graph Neural Networks for Graph Pooling","date":"2019-06-30","arxiv_id":"1907.00481","repositories_listed":4,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"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) · 6 unverified","sample_list":"/paper/mincut-pooling-in-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1907.00481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.00481"}},"official":{"repos":["FilippoMB/Spectral-Clustering-with-Graph-Neural-Networks-for-Graph-Pooling","FilippoMB/Benchmark_dataset_for_graph_classification"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/instance-segmentation-by-jointly-optimizing-1","slug":"instance-segmentation-by-jointly-optimizing-1","title":"Instance Segmentation by Jointly Optimizing Spatial Embeddings and Clustering Bandwidth","date":"2019-06-26","arxiv_id":"1906.11109","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/instance-segmentation-by-jointly-optimizing-1#ran","syntology_url":"https://syntology.ai/paper/1906.11109","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.11109"}},"official":{"repos":["davyneven/SpatialEmbeddings"],"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/edge-labeling-graph-neural-network-for-few","slug":"edge-labeling-graph-neural-network-for-few","title":"Edge-labeling Graph Neural Network for Few-shot Learning","date":"2019-05-04","arxiv_id":"1905.01436","repositories_listed":4,"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/edge-labeling-graph-neural-network-for-few#ran","syntology_url":"https://syntology.ai/paper/1905.01436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01436"}},"official":{"repos":["khy0809/fewshot-egnn"],"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/linkage-based-face-clustering-via-graph","slug":"linkage-based-face-clustering-via-graph","title":"Linkage Based Face Clustering via Graph Convolution Network","date":"2019-03-27","arxiv_id":"1903.11306","repositories_listed":4,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/linkage-based-face-clustering-via-graph#ran","syntology_url":"https://syntology.ai/paper/1903.11306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.11306"}},"official":{"repos":["Zhongdao/gcn_clustering"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-autoencoders-for-generating-3d","slug":"adversarial-autoencoders-for-generating-3d","title":"Adversarial Autoencoders for Compact Representations of 3D Point Clouds","date":"2018-11-19","arxiv_id":"1811.07605","repositories_listed":4,"syntology":null},{"url":"/paper/faster-k-medoids-clustering-improving-the-pam","slug":"faster-k-medoids-clustering-improving-the-pam","title":"Faster k-Medoids Clustering: Improving the PAM, CLARA, and CLARANS Algorithms","date":"2018-10-12","arxiv_id":"1810.05691","repositories_listed":4,"syntology":null},{"url":"/paper/segmenting-unknown-3d-objects-from-real-depth","slug":"segmenting-unknown-3d-objects-from-real-depth","title":"Segmenting Unknown 3D Objects from Real Depth Images using Mask R-CNN Trained on Synthetic Data","date":"2018-09-16","arxiv_id":"1809.05825","repositories_listed":4,"syntology":null},{"url":"/paper/safecity-understanding-diverse-forms-of","slug":"safecity-understanding-diverse-forms-of","title":"SafeCity: Understanding Diverse Forms of Sexual Harassment Personal Stories","date":"2018-09-13","arxiv_id":"1809.04739","repositories_listed":4,"syntology":null},{"url":"/paper/comparative-studies-of-detecting-abusive","slug":"comparative-studies-of-detecting-abusive","title":"Comparative Studies of Detecting Abusive Language on Twitter","date":"2018-08-30","arxiv_id":"1808.10245","repositories_listed":4,"syntology":null},{"url":"/paper/recurrent-deep-embedding-networks-for","slug":"recurrent-deep-embedding-networks-for","title":"Convolutional Embedded Networks for Population Scale Clustering and Bio-ancestry Inferencing","date":"2018-05-30","arxiv_id":"1805.12218","repositories_listed":4,"syntology":null},{"url":"/paper/adversarially-regularized-graph-autoencoder","slug":"adversarially-regularized-graph-autoencoder","title":"Adversarially Regularized Graph Autoencoder for Graph Embedding","date":"2018-02-13","arxiv_id":"1802.04407","repositories_listed":4,"syntology":null},{"url":"/paper/deep-temporal-clustering-fully-unsupervised","slug":"deep-temporal-clustering-fully-unsupervised","title":"Deep Temporal Clustering : Fully Unsupervised Learning of Time-Domain Features","date":"2018-02-04","arxiv_id":"1802.01059","repositories_listed":4,"syntology":null},{"url":"/paper/speaker-diarization-with-lstm","slug":"speaker-diarization-with-lstm","title":"Speaker Diarization with LSTM","date":"2017-10-28","arxiv_id":"1710.10468","repositories_listed":4,"syntology":null},{"url":"/paper/semantic-autoencoder-for-zero-shot-learning","slug":"semantic-autoencoder-for-zero-shot-learning","title":"Semantic Autoencoder for Zero-Shot Learning","date":"2017-04-26","arxiv_id":"1704.08345","repositories_listed":4,"syntology":null},{"url":"/paper/scdv-sparse-composite-document-vectors-using","slug":"scdv-sparse-composite-document-vectors-using","title":"SCDV : Sparse Composite Document Vectors using soft clustering over distributional representations","date":"2016-12-20","arxiv_id":"1612.06778","repositories_listed":4,"syntology":null},{"url":"/paper/deep-unsupervised-clustering-with-gaussian","slug":"deep-unsupervised-clustering-with-gaussian","title":"Deep Unsupervised Clustering with Gaussian Mixture Variational Autoencoders","date":"2016-11-08","arxiv_id":"1611.02648","repositories_listed":4,"syntology":null},{"url":"/paper/tensorflow-large-scale-machine-learning-on","slug":"tensorflow-large-scale-machine-learning-on","title":"TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systems","date":"2016-03-14","arxiv_id":"1603.04467","repositories_listed":4,"syntology":null},{"url":"/paper/spectral-networks-and-locally-connected","slug":"spectral-networks-and-locally-connected","title":"Spectral Networks and Locally Connected Networks on Graphs","date":"2013-12-21","arxiv_id":"1312.6203","repositories_listed":4,"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/spectral-networks-and-locally-connected#ran","syntology_url":"https://syntology.ai/paper/1312.6203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1312.6203"}},"official":null}},{"url":"/paper/sparse-subspace-clustering-algorithm-theory","slug":"sparse-subspace-clustering-algorithm-theory","title":"Sparse Subspace Clustering: Algorithm, Theory, and Applications","date":"2012-03-05","arxiv_id":"1203.1005","repositories_listed":4,"syntology":null},{"url":"/paper/an-empirical-study-into-clustering-of-unseen","slug":"an-empirical-study-into-clustering-of-unseen","title":"An Empirical Study into Clustering of Unseen Datasets with Self-Supervised Encoders","date":"2024-06-04","arxiv_id":"2406.02465","repositories_listed":3,"syntology":{"n":18,"n_ran":15,"n_constructed":0,"n_ran_checked":8,"n_instrument":7,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 7 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/an-empirical-study-into-clustering-of-unseen#ran","syntology_url":"https://syntology.ai/paper/2406.02465","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.02465"}},"official":{"repos":["scottclowe/zs-ssl-clustering"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/retsim-resilient-and-efficient-text","slug":"retsim-resilient-and-efficient-text","title":"RETSim: Resilient and Efficient Text Similarity","date":"2023-11-28","arxiv_id":"2311.17264","repositories_listed":3,"syntology":null},{"url":"/paper/upcycling-models-under-domain-and-category","slug":"upcycling-models-under-domain-and-category","title":"Upcycling Models under Domain and Category Shift","date":"2023-03-13","arxiv_id":"2303.07110","repositories_listed":3,"syntology":null},{"url":"/paper/convex-clustering-through-mm-an-efficient","slug":"convex-clustering-through-mm-an-efficient","title":"Convex Clustering through MM: An Efficient Algorithm to Perform Hierarchical Clustering","date":"2022-11-03","arxiv_id":"2211.01877","repositories_listed":3,"syntology":null},{"url":"/paper/k-means-mask-transformer","slug":"k-means-mask-transformer","title":"kMaX-DeepLab: k-means Mask Transformer","date":"2022-07-08","arxiv_id":"2207.04044","repositories_listed":3,"syntology":null},{"url":"/paper/word-discovery-in-visually-grounded-self","slug":"word-discovery-in-visually-grounded-self","title":"Word Discovery in Visually Grounded, Self-Supervised Speech Models","date":"2022-03-28","arxiv_id":"2203.15081","repositories_listed":3,"syntology":null},{"url":"/paper/bertopic-neural-topic-modeling-with-a-class","slug":"bertopic-neural-topic-modeling-with-a-class","title":"BERTopic: Neural topic modeling with a class-based TF-IDF procedure","date":"2022-03-11","arxiv_id":"2203.05794","repositories_listed":3,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/bertopic-neural-topic-modeling-with-a-class#ran","syntology_url":"https://syntology.ai/paper/2203.05794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05794"}},"official":{"repos":["MaartenGr/BERTopic","maartengr/bertopic_evaluation"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/high-order-correlation-preserved-incomplete","slug":"high-order-correlation-preserved-incomplete","title":"High-order Correlation Preserved Incomplete Multi-view Subspace Clustering","date":"2022-02-21","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/graph-encoder-embedding","slug":"graph-encoder-embedding","title":"One-Hot Graph Encoder Embedding","date":"2021-09-27","arxiv_id":"2109.13098","repositories_listed":3,"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":2,"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/graph-encoder-embedding#ran","syntology_url":"https://syntology.ai/paper/2109.13098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.13098"}},"official":{"repos":["cshen6/graphemd","cshen6/graphnn"],"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/learning-hierarchical-graph-neural-networks","slug":"learning-hierarchical-graph-neural-networks","title":"Learning Hierarchical Graph Neural Networks for Image Clustering","date":"2021-07-03","arxiv_id":"2107.01319","repositories_listed":3,"syntology":null},{"url":"/paper/exploring-visual-context-for-weakly","slug":"exploring-visual-context-for-weakly","title":"Exploring Visual Context for Weakly Supervised Person Search","date":"2021-06-19","arxiv_id":"2106.10506","repositories_listed":3,"syntology":null},{"url":"/paper/parchain-a-framework-for-parallel","slug":"parchain-a-framework-for-parallel","title":"ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain","date":"2021-06-08","arxiv_id":"2106.04727","repositories_listed":3,"syntology":null},{"url":"/paper/exemplar-based-open-set-panoptic-segmentation","slug":"exemplar-based-open-set-panoptic-segmentation","title":"Exemplar-Based Open-Set Panoptic Segmentation Network","date":"2021-05-18","arxiv_id":"2105.08336","repositories_listed":3,"syntology":null},{"url":"/paper/cross-domain-adaptive-clustering-for-semi","slug":"cross-domain-adaptive-clustering-for-semi","title":"Cross-Domain Adaptive Clustering for Semi-Supervised Domain Adaptation","date":"2021-04-19","arxiv_id":"2104.09415","repositories_listed":3,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cross-domain-adaptive-clustering-for-semi#ran","syntology_url":"https://syntology.ai/paper/2104.09415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.09415"}},"official":{"repos":["lijichang/CVPR2021-SSDA"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/confluence-a-robust-non-iou-alternative-to","slug":"confluence-a-robust-non-iou-alternative-to","title":"Confluence: A Robust Non-IoU Alternative to Non-Maxima Suppression in Object Detection","date":"2020-12-01","arxiv_id":"2012.00257","repositories_listed":3,"syntology":null},{"url":"/paper/x-class-text-classification-with-extremely","slug":"x-class-text-classification-with-extremely","title":"X-Class: Text Classification with Extremely Weak Supervision","date":"2020-10-24","arxiv_id":"2010.12794","repositories_listed":3,"syntology":null},{"url":"/paper/fedgroup-ternary-cosine-similarity-based","slug":"fedgroup-ternary-cosine-similarity-based","title":"FedGroup: Efficient Clustered Federated Learning via Decomposed Data-Driven Measure","date":"2020-10-14","arxiv_id":"2010.06870","repositories_listed":3,"syntology":null},{"url":"/paper/fast-and-eager-k-medoids-clustering-o-k","slug":"fast-and-eager-k-medoids-clustering-o-k","title":"Fast and Eager k-Medoids Clustering: O(k) Runtime Improvement of the PAM, CLARA, and CLARANS Algorithms","date":"2020-08-12","arxiv_id":"2008.05171","repositories_listed":3,"syntology":null},{"url":"/paper/graph-structure-of-neural-networks","slug":"graph-structure-of-neural-networks","title":"Graph Structure of Neural Networks","date":"2020-07-13","arxiv_id":"2007.06559","repositories_listed":3,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"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) · 0 unverified","sample_list":"/paper/graph-structure-of-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2007.06559","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.06559"}},"official":{"repos":["facebookresearch/graph2nn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-efficient-framework-for-clustered","slug":"an-efficient-framework-for-clustered","title":"An Efficient Framework for Clustered Federated Learning","date":"2020-06-07","arxiv_id":"2006.04088","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-efficient-framework-for-clustered#ran","syntology_url":"https://syntology.ai/paper/2006.04088","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04088"}},"official":{"repos":["jichan3751/ifca"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/self-paced-contrastive-learning-with-hybrid","slug":"self-paced-contrastive-learning-with-hybrid","title":"Self-paced Contrastive Learning with Hybrid Memory for Domain Adaptive Object Re-ID","date":"2020-06-04","arxiv_id":"2006.02713","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/self-paced-contrastive-learning-with-hybrid#ran","syntology_url":"https://syntology.ai/paper/2006.02713","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.02713"}},"official":{"repos":["yxgeee/SpCL"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-speaker-diarization-for-an-unknown","slug":"end-to-end-speaker-diarization-for-an-unknown","title":"End-to-End Speaker Diarization for an Unknown Number of Speakers with Encoder-Decoder Based Attractors","date":"2020-05-20","arxiv_id":"2005.09921","repositories_listed":3,"syntology":{"n":21,"n_ran":19,"n_constructed":0,"n_ran_checked":19,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":19,"n_pointer_only":0,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 0 honoured, 0 violated, 19 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/end-to-end-speaker-diarization-for-an-unknown#ran","syntology_url":"https://syntology.ai/paper/2005.09921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09921"}},"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/multi-center-federated-learning","slug":"multi-center-federated-learning","title":"Multi-Center Federated Learning: Clients Clustering for Better Personalization","date":"2020-05-03","arxiv_id":"2005.01026","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-center-federated-learning#ran","syntology_url":"https://syntology.ai/paper/2005.01026","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01026"}},"official":{"repos":["mingxuts/multi-center-fed-learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/motif-based-spectral-clustering-of-weighted","slug":"motif-based-spectral-clustering-of-weighted","title":"Motif-Based Spectral Clustering of Weighted Directed Networks","date":"2020-04-02","arxiv_id":"2004.01293","repositories_listed":3,"syntology":null},{"url":"/paper/learning-to-cluster-faces-via-confidence-and","slug":"learning-to-cluster-faces-via-confidence-and","title":"Learning to Cluster Faces via Confidence and Connectivity Estimation","date":"2020-04-01","arxiv_id":"2004.00445","repositories_listed":3,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/learning-to-cluster-faces-via-confidence-and#ran","syntology_url":"https://syntology.ai/paper/2004.00445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.00445"}},"official":{"repos":["yl-1993/learn-to-cluster"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/explainable-k-means-and-k-medians-clustering","slug":"explainable-k-means-and-k-medians-clustering","title":"Explainable $k$-Means and $k$-Medians Clustering","date":"2020-02-28","arxiv_id":"2002.12538","repositories_listed":3,"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/explainable-k-means-and-k-medians-clustering#ran","syntology_url":"https://syntology.ai/paper/2002.12538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12538"}},"official":{"repos":["navefr/ExKMC"],"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/unsupervised-change-detection-in-multi","slug":"unsupervised-change-detection-in-multi","title":"Unsupervised Change Detection in Multi-temporal VHR Images Based on Deep Kernel PCA Convolutional Mapping Network","date":"2019-12-18","arxiv_id":"1912.08628","repositories_listed":3,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unsupervised-change-detection-in-multi#ran","syntology_url":"https://syntology.ai/paper/1912.08628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.08628"}},"official":null}},{"url":"/paper/embedmask-embedding-coupling-for-one-stage","slug":"embedmask-embedding-coupling-for-one-stage","title":"EmbedMask: Embedding Coupling for One-stage Instance Segmentation","date":"2019-12-04","arxiv_id":"1912.01954","repositories_listed":3,"syntology":null},{"url":"/paper/probminhash-a-class-of-locality-sensitive","slug":"probminhash-a-class-of-locality-sensitive","title":"ProbMinHash -- A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity","date":"2019-11-02","arxiv_id":"1911.00675","repositories_listed":3,"syntology":null},{"url":"/paper/diffusion-improves-graph-learning-1","slug":"diffusion-improves-graph-learning-1","title":"Diffusion Improves Graph Learning","date":"2019-10-28","arxiv_id":"1911.05485","repositories_listed":3,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 3 unverified","sample_list":"/paper/diffusion-improves-graph-learning-1#ran","syntology_url":"https://syntology.ai/paper/1911.05485","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.05485"}},"official":{"repos":["klicperajo/gdc"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/vq-wav2vec-self-supervised-learning-of-1","slug":"vq-wav2vec-self-supervised-learning-of-1","title":"vq-wav2vec: Self-Supervised Learning of Discrete Speech Representations","date":"2019-10-12","arxiv_id":"1910.05453","repositories_listed":3,"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/vq-wav2vec-self-supervised-learning-of-1#ran","syntology_url":"https://syntology.ai/paper/1910.05453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.05453"}},"official":null}},{"url":"/paper/fuse-multi-faceted-set-expansion-by-coherent","slug":"fuse-multi-faceted-set-expansion-by-coherent","title":"FUSE: Multi-Faceted Set Expansion by Coherent Clustering of Skip-grams","date":"2019-10-10","arxiv_id":"1910.04345","repositories_listed":3,"syntology":null}],"syntology_records":54,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":419,"papers_where_code_ran_first_page":"/task/clustering/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":108,"url":"/task/clustering/papers/2","json":"/task/clustering/papers/2.json","rows":100},{"order":"archive","page":3,"of":108,"url":"/task/clustering/papers/3","json":"/task/clustering/papers/3.json","rows":100},{"order":"archive","page":4,"of":108,"url":"/task/clustering/papers/4","json":"/task/clustering/papers/4.json","rows":100},{"order":"archive","page":5,"of":108,"url":"/task/clustering/papers/5","json":"/task/clustering/papers/5.json","rows":100},{"order":"archive","page":6,"of":108,"url":"/task/clustering/papers/6","json":"/task/clustering/papers/6.json","rows":100},{"order":"archive","page":7,"of":108,"url":"/task/clustering/papers/7","json":"/task/clustering/papers/7.json","rows":100},{"order":"archive","page":8,"of":108,"url":"/task/clustering/papers/8","json":"/task/clustering/papers/8.json","rows":100},{"order":"archive","page":9,"of":108,"url":"/task/clustering/papers/9","json":"/task/clustering/papers/9.json","rows":100},{"order":"archive","page":10,"of":108,"url":"/task/clustering/papers/10","json":"/task/clustering/papers/10.json","rows":100},{"order":"archive","page":11,"of":108,"url":"/task/clustering/papers/11","json":"/task/clustering/papers/11.json","rows":100},{"order":"archive","page":12,"of":108,"url":"/task/clustering/papers/12","json":"/task/clustering/papers/12.json","rows":100},{"order":"archive","page":13,"of":108,"url":"/task/clustering/papers/13","json":"/task/clustering/papers/13.json","rows":100},{"order":"archive","page":14,"of":108,"url":"/task/clustering/papers/14","json":"/task/clustering/papers/14.json","rows":100},{"order":"archive","page":15,"of":108,"url":"/task/clustering/papers/15","json":"/task/clustering/papers/15.json","rows":100},{"order":"archive","page":16,"of":108,"url":"/task/clustering/papers/16","json":"/task/clustering/papers/16.json","rows":100},{"order":"archive","page":17,"of":108,"url":"/task/clustering/papers/17","json":"/task/clustering/papers/17.json","rows":100},{"order":"archive","page":18,"of":108,"url":"/task/clustering/papers/18","json":"/task/clustering/papers/18.json","rows":100},{"order":"archive","page":19,"of":108,"url":"/task/clustering/papers/19","json":"/task/clustering/papers/19.json","rows":100},{"order":"archive","page":20,"of":108,"url":"/task/clustering/papers/20","json":"/task/clustering/papers/20.json","rows":100},{"order":"archive","page":21,"of":108,"url":"/task/clustering/papers/21","json":"/task/clustering/papers/21.json","rows":100},{"order":"archive","page":22,"of":108,"url":"/task/clustering/papers/22","json":"/task/clustering/papers/22.json","rows":100},{"order":"archive","page":23,"of":108,"url":"/task/clustering/papers/23","json":"/task/clustering/papers/23.json","rows":100},{"order":"archive","page":24,"of":108,"url":"/task/clustering/papers/24","json":"/task/clustering/papers/24.json","rows":100},{"order":"archive","page":25,"of":108,"url":"/task/clustering/papers/25","json":"/task/clustering/papers/25.json","rows":100},{"order":"archive","page":26,"of":108,"url":"/task/clustering/papers/26","json":"/task/clustering/papers/26.json","rows":100},{"order":"archive","page":27,"of":108,"url":"/task/clustering/papers/27","json":"/task/clustering/papers/27.json","rows":100},{"order":"archive","page":28,"of":108,"url":"/task/clustering/papers/28","json":"/task/clustering/papers/28.json","rows":100},{"order":"archive","page":29,"of":108,"url":"/task/clustering/papers/29","json":"/task/clustering/papers/29.json","rows":100},{"order":"archive","page":30,"of":108,"url":"/task/clustering/papers/30","json":"/task/clustering/papers/30.json","rows":100},{"order":"archive","page":31,"of":108,"url":"/task/clustering/papers/31","json":"/task/clustering/papers/31.json","rows":100},{"order":"archive","page":32,"of":108,"url":"/task/clustering/papers/32","json":"/task/clustering/papers/32.json","rows":100},{"order":"archive","page":33,"of":108,"url":"/task/clustering/papers/33","json":"/task/clustering/papers/33.json","rows":100},{"order":"archive","page":34,"of":108,"url":"/task/clustering/papers/34","json":"/task/clustering/papers/34.json","rows":100},{"order":"archive","page":35,"of":108,"url":"/task/clustering/papers/35","json":"/task/clustering/papers/35.json","rows":100},{"order":"archive","page":36,"of":108,"url":"/task/clustering/papers/36","json":"/task/clustering/papers/36.json","rows":100},{"order":"archive","page":37,"of":108,"url":"/task/clustering/papers/37","json":"/task/clustering/papers/37.json","rows":100},{"order":"archive","page":38,"of":108,"url":"/task/clustering/papers/38","json":"/task/clustering/papers/38.json","rows":100},{"order":"archive","page":39,"of":108,"url":"/task/clustering/papers/39","json":"/task/clustering/papers/39.json","rows":100},{"order":"archive","page":40,"of":108,"url":"/task/clustering/papers/40","json":"/task/clustering/papers/40.json","rows":100},{"order":"archive","page":41,"of":108,"url":"/task/clustering/papers/41","json":"/task/clustering/papers/41.json","rows":100},{"order":"archive","page":42,"of":108,"url":"/task/clustering/papers/42","json":"/task/clustering/papers/42.json","rows":100},{"order":"archive","page":43,"of":108,"url":"/task/clustering/papers/43","json":"/task/clustering/papers/43.json","rows":100},{"order":"archive","page":44,"of":108,"url":"/task/clustering/papers/44","json":"/task/clustering/papers/44.json","rows":100},{"order":"archive","page":45,"of":108,"url":"/task/clustering/papers/45","json":"/task/clustering/papers/45.json","rows":100},{"order":"archive","page":46,"of":108,"url":"/task/clustering/papers/46","json":"/task/clustering/papers/46.json","rows":100},{"order":"archive","page":47,"of":108,"url":"/task/clustering/papers/47","json":"/task/clustering/papers/47.json","rows":100},{"order":"archive","page":48,"of":108,"url":"/task/clustering/papers/48","json":"/task/clustering/papers/48.json","rows":100},{"order":"archive","page":49,"of":108,"url":"/task/clustering/papers/49","json":"/task/clustering/papers/49.json","rows":100},{"order":"archive","page":50,"of":108,"url":"/task/clustering/papers/50","json":"/task/clustering/papers/50.json","rows":100},{"order":"archive","page":51,"of":108,"url":"/task/clustering/papers/51","json":"/task/clustering/papers/51.json","rows":100},{"order":"archive","page":52,"of":108,"url":"/task/clustering/papers/52","json":"/task/clustering/papers/52.json","rows":100},{"order":"archive","page":53,"of":108,"url":"/task/clustering/papers/53","json":"/task/clustering/papers/53.json","rows":100},{"order":"archive","page":54,"of":108,"url":"/task/clustering/papers/54","json":"/task/clustering/papers/54.json","rows":100},{"order":"archive","page":55,"of":108,"url":"/task/clustering/papers/55","json":"/task/clustering/papers/55.json","rows":100},{"order":"archive","page":56,"of":108,"url":"/task/clustering/papers/56","json":"/task/clustering/papers/56.json","rows":100},{"order":"archive","page":57,"of":108,"url":"/task/clustering/papers/57","json":"/task/clustering/papers/57.json","rows":100},{"order":"archive","page":58,"of":108,"url":"/task/clustering/papers/58","json":"/task/clustering/papers/58.json","rows":100},{"order":"archive","page":59,"of":108,"url":"/task/clustering/papers/59","json":"/task/clustering/papers/59.json","rows":100},{"order":"archive","page":60,"of":108,"url":"/task/clustering/papers/60","json":"/task/clustering/papers/60.json","rows":100},{"order":"archive","page":61,"of":108,"url":"/task/clustering/papers/61","json":"/task/clustering/papers/61.json","rows":100},{"order":"archive","page":62,"of":108,"url":"/task/clustering/papers/62","json":"/task/clustering/papers/62.json","rows":100},{"order":"archive","page":63,"of":108,"url":"/task/clustering/papers/63","json":"/task/clustering/papers/63.json","rows":100},{"order":"archive","page":64,"of":108,"url":"/task/clustering/papers/64","json":"/task/clustering/papers/64.json","rows":100},{"order":"archive","page":65,"of":108,"url":"/task/clustering/papers/65","json":"/task/clustering/papers/65.json","rows":100},{"order":"archive","page":66,"of":108,"url":"/task/clustering/papers/66","json":"/task/clustering/papers/66.json","rows":100},{"order":"archive","page":67,"of":108,"url":"/task/clustering/papers/67","json":"/task/clustering/papers/67.json","rows":100},{"order":"archive","page":68,"of":108,"url":"/task/clustering/papers/68","json":"/task/clustering/papers/68.json","rows":100},{"order":"archive","page":69,"of":108,"url":"/task/clustering/papers/69","json":"/task/clustering/papers/69.json","rows":100},{"order":"archive","page":70,"of":108,"url":"/task/clustering/papers/70","json":"/task/clustering/papers/70.json","rows":100},{"order":"archive","page":71,"of":108,"url":"/task/clustering/papers/71","json":"/task/clustering/papers/71.json","rows":100},{"order":"archive","page":72,"of":108,"url":"/task/clustering/papers/72","json":"/task/clustering/papers/72.json","rows":100},{"order":"archive","page":73,"of":108,"url":"/task/clustering/papers/73","json":"/task/clustering/papers/73.json","rows":100},{"order":"archive","page":74,"of":108,"url":"/task/clustering/papers/74","json":"/task/clustering/papers/74.json","rows":100},{"order":"archive","page":75,"of":108,"url":"/task/clustering/papers/75","json":"/task/clustering/papers/75.json","rows":100},{"order":"archive","page":76,"of":108,"url":"/task/clustering/papers/76","json":"/task/clustering/papers/76.json","rows":100},{"order":"archive","page":77,"of":108,"url":"/task/clustering/papers/77","json":"/task/clustering/papers/77.json","rows":100},{"order":"archive","page":78,"of":108,"url":"/task/clustering/papers/78","json":"/task/clustering/papers/78.json","rows":100},{"order":"archive","page":79,"of":108,"url":"/task/clustering/papers/79","json":"/task/clustering/papers/79.json","rows":100},{"order":"archive","page":80,"of":108,"url":"/task/clustering/papers/80","json":"/task/clustering/papers/80.json","rows":100},{"order":"archive","page":81,"of":108,"url":"/task/clustering/papers/81","json":"/task/clustering/papers/81.json","rows":100},{"order":"archive","page":82,"of":108,"url":"/task/clustering/papers/82","json":"/task/clustering/papers/82.json","rows":100},{"order":"archive","page":83,"of":108,"url":"/task/clustering/papers/83","json":"/task/clustering/papers/83.json","rows":100},{"order":"archive","page":84,"of":108,"url":"/task/clustering/papers/84","json":"/task/clustering/papers/84.json","rows":100},{"order":"archive","page":85,"of":108,"url":"/task/clustering/papers/85","json":"/task/clustering/papers/85.json","rows":100},{"order":"archive","page":86,"of":108,"url":"/task/clustering/papers/86","json":"/task/clustering/papers/86.json","rows":100},{"order":"archive","page":87,"of":108,"url":"/task/clustering/papers/87","json":"/task/clustering/papers/87.json","rows":100},{"order":"archive","page":88,"of":108,"url":"/task/clustering/papers/88","json":"/task/clustering/papers/88.json","rows":100},{"order":"archive","page":89,"of":108,"url":"/task/clustering/papers/89","json":"/task/clustering/papers/89.json","rows":100},{"order":"archive","page":90,"of":108,"url":"/task/clustering/papers/90","json":"/task/clustering/papers/90.json","rows":100},{"order":"archive","page":91,"of":108,"url":"/task/clustering/papers/91","json":"/task/clustering/papers/91.json","rows":100},{"order":"archive","page":92,"of":108,"url":"/task/clustering/papers/92","json":"/task/clustering/papers/92.json","rows":100},{"order":"archive","page":93,"of":108,"url":"/task/clustering/papers/93","json":"/task/clustering/papers/93.json","rows":100},{"order":"archive","page":94,"of":108,"url":"/task/clustering/papers/94","json":"/task/clustering/papers/94.json","rows":100},{"order":"archive","page":95,"of":108,"url":"/task/clustering/papers/95","json":"/task/clustering/papers/95.json","rows":100},{"order":"archive","page":96,"of":108,"url":"/task/clustering/papers/96","json":"/task/clustering/papers/96.json","rows":100},{"order":"archive","page":97,"of":108,"url":"/task/clustering/papers/97","json":"/task/clustering/papers/97.json","rows":100},{"order":"archive","page":98,"of":108,"url":"/task/clustering/papers/98","json":"/task/clustering/papers/98.json","rows":100},{"order":"archive","page":99,"of":108,"url":"/task/clustering/papers/99","json":"/task/clustering/papers/99.json","rows":100},{"order":"archive","page":100,"of":108,"url":"/task/clustering/papers/100","json":"/task/clustering/papers/100.json","rows":100},{"order":"archive","page":101,"of":108,"url":"/task/clustering/papers/101","json":"/task/clustering/papers/101.json","rows":100},{"order":"archive","page":102,"of":108,"url":"/task/clustering/papers/102","json":"/task/clustering/papers/102.json","rows":100},{"order":"archive","page":103,"of":108,"url":"/task/clustering/papers/103","json":"/task/clustering/papers/103.json","rows":100},{"order":"archive","page":104,"of":108,"url":"/task/clustering/papers/104","json":"/task/clustering/papers/104.json","rows":100},{"order":"archive","page":105,"of":108,"url":"/task/clustering/papers/105","json":"/task/clustering/papers/105.json","rows":100},{"order":"archive","page":106,"of":108,"url":"/task/clustering/papers/106","json":"/task/clustering/papers/106.json","rows":100},{"order":"archive","page":107,"of":108,"url":"/task/clustering/papers/107","json":"/task/clustering/papers/107.json","rows":100},{"order":"archive","page":108,"of":108,"url":"/task/clustering/papers/108","json":"/task/clustering/papers/108.json","rows":18},{"order":"ran","page":1,"of":5,"url":"/task/clustering/papers/ran/1","json":"/task/clustering/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":5,"url":"/task/clustering/papers/ran/2","json":"/task/clustering/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":5,"url":"/task/clustering/papers/ran/3","json":"/task/clustering/papers/ran/3.json","rows":100},{"order":"ran","page":4,"of":5,"url":"/task/clustering/papers/ran/4","json":"/task/clustering/papers/ran/4.json","rows":100},{"order":"ran","page":5,"of":5,"url":"/task/clustering/papers/ran/5","json":"/task/clustering/papers/ran/5.json","rows":19}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"5ce9016a8a268c9420494154da1c7a41c8782348b557c8234153aae2a0c0abe7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}