{"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/2","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":2,"pages_in_order":108,"rows_per_page":100,"rows":[101,200],"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","next":"/task/clustering/papers/3","papers":[{"url":"/paper/video-summarization-using-keyframe-extraction","slug":"video-summarization-using-keyframe-extraction","title":"Unsupervised video summarization framework using keyframe extraction and video skimming","date":"2019-10-10","arxiv_id":"1910.04792","repositories_listed":3,"syntology":null},{"url":"/paper/semantic-relatedness-based-re-ranker-for-text","slug":"semantic-relatedness-based-re-ranker-for-text","title":"Semantic Relatedness Based Re-ranker for Text Spotting","date":"2019-09-17","arxiv_id":"1909.07950","repositories_listed":3,"syntology":null},{"url":"/paper/reconstructing-continuously-heterogeneous","slug":"reconstructing-continuously-heterogeneous","title":"Reconstructing continuous distributions of 3D protein structure from cryo-EM images","date":"2019-09-11","arxiv_id":"1909.05215","repositories_listed":3,"syntology":null},{"url":"/paper/attributed-graph-clustering-a-deep","slug":"attributed-graph-clustering-a-deep","title":"Attributed Graph Clustering: A Deep Attentional Embedding Approach","date":"2019-06-15","arxiv_id":"1906.06532","repositories_listed":3,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":1,"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; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/attributed-graph-clustering-a-deep#ran","syntology_url":"https://syntology.ai/paper/1906.06532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06532"}},"official":null}},{"url":"/paper/an-image-clustering-auto-encoder-based-on","slug":"an-image-clustering-auto-encoder-based-on","title":"An Image Clustering Auto-Encoder Based on Predefined Evenly-Distributed Class Centroids and MMD Distance","date":"2019-06-10","arxiv_id":"1906.03905","repositories_listed":3,"syntology":null},{"url":"/paper/learning-to-cluster-faces-on-an-affinity","slug":"learning-to-cluster-faces-on-an-affinity","title":"Learning to Cluster Faces on an Affinity Graph","date":"2019-04-04","arxiv_id":"1904.02749","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"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; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-to-cluster-faces-on-an-affinity#ran","syntology_url":"https://syntology.ai/paper/1904.02749","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02749"}},"official":{"repos":["yl-1993/learn-to-cluster"],"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/learning-representations-of-irregular","slug":"learning-representations-of-irregular","title":"Learning representations of irregular particle-detector geometry with distance-weighted graph networks","date":"2019-02-21","arxiv_id":"1902.07987","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"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) · 2 unverified","sample_list":"/paper/learning-representations-of-irregular#ran","syntology_url":"https://syntology.ai/paper/1902.07987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07987"}},"official":{"repos":["jkiesele/caloGraphNN"],"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/catch22-canonical-time-series-characteristics","slug":"catch22-canonical-time-series-characteristics","title":"catch22: CAnonical Time-series CHaracteristics","date":"2019-01-29","arxiv_id":"1901.10200","repositories_listed":3,"syntology":null},{"url":"/paper/video-trajectory-classification-and-anomaly","slug":"video-trajectory-classification-and-anomaly","title":"Video Trajectory Classification and Anomaly Detection Using Hybrid CNN-VAE","date":"2018-12-18","arxiv_id":"1812.07203","repositories_listed":3,"syntology":null},{"url":"/paper/chemixnet-mixed-dnn-architectures-for","slug":"chemixnet-mixed-dnn-architectures-for","title":"CheMixNet: Mixed DNN Architectures for Predicting Chemical Properties using Multiple Molecular Representations","date":"2018-11-14","arxiv_id":"1811.08283","repositories_listed":3,"syntology":null},{"url":"/paper/catboost-gradient-boosting-with-categorical","slug":"catboost-gradient-boosting-with-categorical","title":"CatBoost: gradient boosting with categorical features support","date":"2018-10-24","arxiv_id":"1810.11363","repositories_listed":3,"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/catboost-gradient-boosting-with-categorical#ran","syntology_url":"https://syntology.ai/paper/1810.11363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.11363"}},"official":{"repos":["catboost/catboost"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/arc-support-line-segments-revisited-an","slug":"arc-support-line-segments-revisited-an","title":"Arc-support Line Segments Revisited: An Efficient and High-quality Ellipse Detection","date":"2018-10-08","arxiv_id":"1810.03243","repositories_listed":3,"syntology":null},{"url":"/paper/ensemble-clustering-for-graphs","slug":"ensemble-clustering-for-graphs","title":"Ensemble Clustering for Graphs","date":"2018-09-14","arxiv_id":"1809.05578","repositories_listed":3,"syntology":null},{"url":"/paper/simplex-representation-for-subspace","slug":"simplex-representation-for-subspace","title":"Scaled Simplex Representation for Subspace Clustering","date":"2018-07-26","arxiv_id":"1807.09930","repositories_listed":3,"syntology":null},{"url":"/paper/a-hybrid-variational-autoencoder-for","slug":"a-hybrid-variational-autoencoder-for","title":"A Hybrid Variational Autoencoder for Collaborative Filtering","date":"2018-07-14","arxiv_id":"1808.01006","repositories_listed":3,"syntology":null},{"url":"/paper/hierarchical-graph-clustering-using-node-pair","slug":"hierarchical-graph-clustering-using-node-pair","title":"Hierarchical Graph Clustering using Node Pair Sampling","date":"2018-06-05","arxiv_id":"1806.01664","repositories_listed":3,"syntology":null},{"url":"/paper/tractseg-fast-and-accurate-white-matter-tract","slug":"tractseg-fast-and-accurate-white-matter-tract","title":"TractSeg - Fast and accurate white matter tract segmentation","date":"2018-05-18","arxiv_id":"1805.07103","repositories_listed":3,"syntology":null},{"url":"/paper/mog-mapper-on-graphs-for-relationship","slug":"mog-mapper-on-graphs-for-relationship","title":"Homology-Preserving Multi-Scale Graph Skeletonization Using Mapper on Graphs","date":"2018-04-03","arxiv_id":"1804.11242","repositories_listed":3,"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/mog-mapper-on-graphs-for-relationship#ran","syntology_url":"https://syntology.ai/paper/1804.11242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.11242"}},"official":{"repos":["USFDataVisualization/MapperOnGraphs","shape-vis/mapperongraphs"],"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/deep-continuous-clustering","slug":"deep-continuous-clustering","title":"Deep Continuous Clustering","date":"2018-03-05","arxiv_id":"1803.01449","repositories_listed":3,"syntology":null},{"url":"/paper/spectralnet-spectral-clustering-using-deep","slug":"spectralnet-spectral-clustering-using-deep","title":"SpectralNet: Spectral Clustering using Deep Neural Networks","date":"2018-01-04","arxiv_id":"1801.01587","repositories_listed":3,"syntology":null},{"url":"/paper/rnn-dbscan-a-density-based-clustering","slug":"rnn-dbscan-a-density-based-clustering","title":"RNN-DBSCAN: A Density-Based Clustering Algorithm Using Reverse Nearest Neighbor Density Estimates","date":"2017-12-27","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/learning-to-rank-question-answer-pairs-using","slug":"learning-to-rank-question-answer-pairs-using","title":"Learning to Rank Question-Answer Pairs using Hierarchical Recurrent Encoder with Latent Topic Clustering","date":"2017-10-10","arxiv_id":"1710.03430","repositories_listed":3,"syntology":null},{"url":"/paper/forecasting-across-time-series-databases","slug":"forecasting-across-time-series-databases","title":"Forecasting Across Time Series Databases using Recurrent Neural Networks on Groups of Similar Series: A Clustering Approach","date":"2017-10-09","arxiv_id":"1710.03222","repositories_listed":3,"syntology":null},{"url":"/paper/learning-multi-attention-convolutional-neural","slug":"learning-multi-attention-convolutional-neural","title":"Learning Multi-Attention Convolutional Neural Network for Fine-Grained Image Recognition","date":"2017-10-01","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/an-efficient-clustering-algorithm-from-the","slug":"an-efficient-clustering-algorithm-from-the","title":"An efficient clustering algorithm from the measure of local Gaussian distribution","date":"2017-09-13","arxiv_id":"1709.08470","repositories_listed":3,"syntology":null},{"url":"/paper/deep-subspace-clustering-networks","slug":"deep-subspace-clustering-networks","title":"Deep Subspace Clustering Networks","date":"2017-09-08","arxiv_id":"1709.02508","repositories_listed":3,"syntology":null},{"url":"/paper/efficient-manifold-and-subspace","slug":"efficient-manifold-and-subspace","title":"Efficient Manifold and Subspace Approximations with Spherelets","date":"2017-06-26","arxiv_id":"1706.08263","repositories_listed":3,"syntology":null},{"url":"/paper/accelerated-hierarchical-density-clustering","slug":"accelerated-hierarchical-density-clustering","title":"Accelerated Hierarchical Density Clustering","date":"2017-05-20","arxiv_id":"1705.07321","repositories_listed":3,"syntology":null},{"url":"/paper/practical-coreset-constructions-for-machine","slug":"practical-coreset-constructions-for-machine","title":"Practical Coreset Constructions for Machine Learning","date":"2017-03-19","arxiv_id":"1703.06476","repositories_listed":3,"syntology":null},{"url":"/paper/multi-talker-speech-separation-with-utterance","slug":"multi-talker-speech-separation-with-utterance","title":"Multi-talker Speech Separation with Utterance-level Permutation Invariant Training of Deep Recurrent Neural Networks","date":"2017-03-18","arxiv_id":"1703.06284","repositories_listed":3,"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":3,"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/multi-talker-speech-separation-with-utterance#ran","syntology_url":"https://syntology.ai/paper/1703.06284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06284"}},"official":null}},{"url":"/paper/a-general-and-adaptive-robust-loss-function","slug":"a-general-and-adaptive-robust-loss-function","title":"A General and Adaptive Robust Loss Function","date":"2017-01-11","arxiv_id":"1701.03077","repositories_listed":3,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-general-and-adaptive-robust-loss-function#ran","syntology_url":"https://syntology.ai/paper/1701.03077","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.03077"}},"official":{"repos":["google-research/google-research"],"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/flood-filling-networks","slug":"flood-filling-networks","title":"Flood-Filling Networks","date":"2016-11-01","arxiv_id":"1611.00421","repositories_listed":3,"syntology":null},{"url":"/paper/subgraph2vec-learning-distributed","slug":"subgraph2vec-learning-distributed","title":"subgraph2vec: Learning Distributed Representations of Rooted Sub-graphs from Large Graphs","date":"2016-06-29","arxiv_id":"1606.08928","repositories_listed":3,"syntology":null},{"url":"/paper/joint-unsupervised-learning-of-deep","slug":"joint-unsupervised-learning-of-deep","title":"Joint Unsupervised Learning of Deep Representations and Image Clusters","date":"2016-04-13","arxiv_id":"1604.03628","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":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/joint-unsupervised-learning-of-deep#ran","syntology_url":"https://syntology.ai/paper/1604.03628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1604.03628"}},"official":{"repos":["jwyang/joint-unsupervised-learning"],"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/non-normal-mixtures-of-experts","slug":"non-normal-mixtures-of-experts","title":"Non-Normal Mixtures of Experts","date":"2015-06-22","arxiv_id":"1506.06707","repositories_listed":3,"syntology":null},{"url":"/paper/short-text-clustering-via-convolutional","slug":"short-text-clustering-via-convolutional","title":"Short Text Clustering via Convolutional Neural Networks","date":"2015-06-01","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/the-ordered-weighted-ell_1-norm-atomic","slug":"the-ordered-weighted-ell_1-norm-atomic","title":"The Ordered Weighted $\\ell_1$ Norm: Atomic Formulation, Projections, and Algorithms","date":"2014-09-15","arxiv_id":"1409.4271","repositories_listed":3,"syntology":null},{"url":"/paper/spectral-clustering-of-graphs-with-the-bethe","slug":"spectral-clustering-of-graphs-with-the-bethe","title":"Spectral Clustering of Graphs with the Bethe Hessian","date":"2014-06-07","arxiv_id":"1406.1880","repositories_listed":3,"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/spectral-clustering-of-graphs-with-the-bethe#ran","syntology_url":"https://syntology.ai/paper/1406.1880","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1406.1880"}},"official":null}},{"url":"/paper/projection-onto-the-probability-simplex-an","slug":"projection-onto-the-probability-simplex-an","title":"Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application","date":"2013-09-06","arxiv_id":"1309.1541","repositories_listed":3,"syntology":null},{"url":"/paper/scikit-learn-machine-learning-in-python","slug":"scikit-learn-machine-learning-in-python","title":"Scikit-learn: Machine Learning in Python","date":"2012-01-02","arxiv_id":"1201.0490","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":0,"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/scikit-learn-machine-learning-in-python#ran","syntology_url":"https://syntology.ai/paper/1201.0490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1201.0490"}},"official":null}},{"url":"/paper/large-scale-correlation-clustering","slug":"large-scale-correlation-clustering","title":"Large Scale Correlation Clustering Optimization","date":"2011-12-13","arxiv_id":"1112.2903","repositories_listed":3,"syntology":null},{"url":"/paper/classifying-and-clustering-trading-agents","slug":"classifying-and-clustering-trading-agents","title":"Classifying and Clustering Trading Agents","date":"2025-05-27","arxiv_id":"2505.21662","repositories_listed":2,"syntology":null},{"url":"/paper/tree-guided-l-1-convex-clustering","slug":"tree-guided-l-1-convex-clustering","title":"Tree-Guided $L_1$-Convex Clustering","date":"2025-03-31","arxiv_id":"2503.24012","repositories_listed":2,"syntology":null},{"url":"/paper/measuring-the-validity-of-clustering","slug":"measuring-the-validity-of-clustering","title":"Measuring the Validity of Clustering Validation Datasets","date":"2025-03-03","arxiv_id":"2503.01097","repositories_listed":2,"syntology":null},{"url":"/paper/duet-dual-clustering-enhanced-multivariate","slug":"duet-dual-clustering-enhanced-multivariate","title":"DUET: Dual Clustering Enhanced Multivariate Time Series Forecasting","date":"2024-12-14","arxiv_id":"2412.10859","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":1,"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/duet-dual-clustering-enhanced-multivariate#ran","syntology_url":"https://syntology.ai/paper/2412.10859","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.10859"}},"official":{"repos":["decisionintelligence/duet"],"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/lorann-low-rank-matrix-factorization-for","slug":"lorann-low-rank-matrix-factorization-for","title":"LoRANN: Low-Rank Matrix Factorization for Approximate Nearest Neighbor Search","date":"2024-10-24","arxiv_id":"2410.18926","repositories_listed":2,"syntology":{"n":20,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/lorann-low-rank-matrix-factorization-for#ran","syntology_url":"https://syntology.ai/paper/2410.18926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.18926"}},"official":{"repos":["ejaasaari/lorann","ejaasaari/lorann-experiments"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/correspondence-free-non-rigid-point-set-1","slug":"correspondence-free-non-rigid-point-set-1","title":"Correspondence-Free Non-Rigid Point Set Registration Using Unsupervised Clustering Analysis","date":"2024-06-27","arxiv_id":"2406.18817","repositories_listed":2,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/correspondence-free-non-rigid-point-set-1#ran","syntology_url":"https://syntology.ai/paper/2406.18817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18817"}},"official":{"repos":["zikai1/cvpr24_pointsetreg"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/synergistic-deep-graph-clustering-network","slug":"synergistic-deep-graph-clustering-network","title":"Synergistic Deep Graph Clustering Network","date":"2024-06-22","arxiv_id":"2406.15797","repositories_listed":2,"syntology":null},{"url":"/paper/unsupervised-extractive-dialogue","slug":"unsupervised-extractive-dialogue","title":"Unsupervised Extractive Dialogue Summarization in Hyperdimensional Space","date":"2024-05-16","arxiv_id":"2405.09765","repositories_listed":2,"syntology":null},{"url":"/paper/bond-bootstrapping-from-scratch-name","slug":"bond-bootstrapping-from-scratch-name","title":"BOND: Bootstrapping From-Scratch Name Disambiguation with Multi-task Promoting","date":"2024-04-12","arxiv_id":"2404.08322","repositories_listed":2,"syntology":null},{"url":"/paper/let-it-flow-simultaneous-optimization-of-3d","slug":"let-it-flow-simultaneous-optimization-of-3d","title":"Let-It-Flow: Simultaneous Optimization of 3D Flow and Object Clustering","date":"2024-04-12","arxiv_id":"2404.08363","repositories_listed":2,"syntology":null},{"url":"/paper/glc-source-free-universal-domain-adaptation","slug":"glc-source-free-universal-domain-adaptation","title":"GLC++: Source-Free Universal Domain Adaptation through Global-Local Clustering and Contrastive Affinity Learning","date":"2024-03-21","arxiv_id":"2403.14410","repositories_listed":2,"syntology":null},{"url":"/paper/cuvler-enhanced-unsupervised-object","slug":"cuvler-enhanced-unsupervised-object","title":"CuVLER: Enhanced Unsupervised Object Discoveries through Exhaustive Self-Supervised Transformers","date":"2024-03-12","arxiv_id":"2403.07700","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/cuvler-enhanced-unsupervised-object#ran","syntology_url":"https://syntology.ai/paper/2403.07700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07700"}},"official":{"repos":["shahaf-arica/cuvler"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/solution-simplex-clustering-for-heterogeneous","slug":"solution-simplex-clustering-for-heterogeneous","title":"Federated Learning over Connected Modes","date":"2024-03-05","arxiv_id":"2403.03333","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":1,"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/solution-simplex-clustering-for-heterogeneous#ran","syntology_url":"https://syntology.ai/paper/2403.03333","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.03333"}},"official":{"repos":["dennis-grinwald/floco"],"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/end-to-end-learnable-clustering-for-intent","slug":"end-to-end-learnable-clustering-for-intent","title":"End-to-end Learnable Clustering for Intent Learning in Recommendation","date":"2024-01-11","arxiv_id":"2401.05975","repositories_listed":2,"syntology":null},{"url":"/paper/meancut-a-greedy-optimized-graph-clustering","slug":"meancut-a-greedy-optimized-graph-clustering","title":"MeanCut: A Greedy-Optimized Graph Clustering via Path-based Similarity and Degree Descent Criterion","date":"2023-12-07","arxiv_id":"2312.04067","repositories_listed":2,"syntology":null},{"url":"/paper/flasc-a-flare-sensitive-clustering-algorithm","slug":"flasc-a-flare-sensitive-clustering-algorithm","title":"FLASC: A Flare-Sensitive Clustering Algorithm","date":"2023-11-27","arxiv_id":"2311.15887","repositories_listed":2,"syntology":null},{"url":"/paper/a-practical-approach-to-novel-class-discovery","slug":"a-practical-approach-to-novel-class-discovery","title":"A Practical Approach to Novel Class Discovery in Tabular Data","date":"2023-11-09","arxiv_id":"2311.05440","repositories_listed":2,"syntology":null},{"url":"/paper/guided-deep-embedded-clustering","slug":"guided-deep-embedded-clustering","title":"Guided deep embedded clustering regularization for multifeature medical signal classification","date":"2023-11-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/distributionally-robust-unsupervised-dense","slug":"distributionally-robust-unsupervised-dense","title":"Enhancing Dense Retrievers' Robustness with Group-level Reweighting","date":"2023-10-25","arxiv_id":"2310.16605","repositories_listed":2,"syntology":null},{"url":"/paper/medoid-silhouette-clustering-with-automatic","slug":"medoid-silhouette-clustering-with-automatic","title":"Medoid Silhouette clustering with automatic cluster number selection","date":"2023-09-07","arxiv_id":"2309.03751","repositories_listed":2,"syntology":null},{"url":"/paper/convert-contrastive-graph-clustering-with","slug":"convert-contrastive-graph-clustering-with","title":"CONVERT:Contrastive Graph Clustering with Reliable Augmentation","date":"2023-08-17","arxiv_id":"2308.08963","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/convert-contrastive-graph-clustering-with#ran","syntology_url":"https://syntology.ai/paper/2308.08963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08963"}},"official":{"repos":["xihongyang1999/convert"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/reinforcement-graph-clustering-with-unknown","slug":"reinforcement-graph-clustering-with-unknown","title":"Reinforcement Graph Clustering with Unknown Cluster Number","date":"2023-08-13","arxiv_id":"2308.06827","repositories_listed":2,"syntology":null},{"url":"/paper/fsd-v2-improving-fully-sparse-3d-object","slug":"fsd-v2-improving-fully-sparse-3d-object","title":"FSD V2: Improving Fully Sparse 3D Object Detection with Virtual Voxels","date":"2023-08-07","arxiv_id":"2308.03755","repositories_listed":2,"syntology":null},{"url":"/paper/sdc-hsdd-ndsa-structure-detecting-cluster-by","slug":"sdc-hsdd-ndsa-structure-detecting-cluster-by","title":"SDC-HSDD-NDSA: Structure Detecting Cluster by Hierarchical Secondary Directed Differential with Normalized Density and Self-Adaption","date":"2023-07-02","arxiv_id":"2307.00677","repositories_listed":2,"syntology":null},{"url":"/paper/online-unsupervised-video-object-segmentation","slug":"online-unsupervised-video-object-segmentation","title":"Online Unsupervised Video Object Segmentation via Contrastive Motion Clustering","date":"2023-06-21","arxiv_id":"2306.12048","repositories_listed":2,"syntology":null},{"url":"/paper/effective-neural-topic-modeling-with","slug":"effective-neural-topic-modeling-with","title":"Effective Neural Topic Modeling with Embedding Clustering Regularization","date":"2023-06-07","arxiv_id":"2306.04217","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"4 ran (of which 4 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) · 0 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/effective-neural-topic-modeling-with#ran","syntology_url":"https://syntology.ai/paper/2306.04217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.04217"}},"official":{"repos":["bobxwu/ecrtm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/dink-net-neural-clustering-on-large-graphs","slug":"dink-net-neural-clustering-on-large-graphs","title":"Dink-Net: Neural Clustering on Large Graphs","date":"2023-05-28","arxiv_id":"2305.18405","repositories_listed":2,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":2,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/dink-net-neural-clustering-on-large-graphs#ran","syntology_url":"https://syntology.ai/paper/2305.18405","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18405"}},"official":{"repos":["yueliu1999/awesome-deep-graph-clustering","yueliu1999/dink-net"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-temporal-graph-clustering","slug":"deep-temporal-graph-clustering","title":"Deep Temporal Graph Clustering","date":"2023-05-18","arxiv_id":"2305.10738","repositories_listed":2,"syntology":null},{"url":"/paper/fastami-a-monte-carlo-approach-to-the","slug":"fastami-a-monte-carlo-approach-to-the","title":"FastAMI -- a Monte Carlo Approach to the Adjustment for Chance in Clustering Comparison Metrics","date":"2023-05-03","arxiv_id":"2305.03022","repositories_listed":2,"syntology":null},{"url":"/paper/ellipsoid-fitting-with-the-cayley-transform","slug":"ellipsoid-fitting-with-the-cayley-transform","title":"Ellipsoid fitting with the Cayley transform","date":"2023-04-20","arxiv_id":"2304.10630","repositories_listed":2,"syntology":null},{"url":"/paper/information-recovery-driven-deep-incomplete","slug":"information-recovery-driven-deep-incomplete","title":"Information Recovery-Driven Deep Incomplete Multiview Clustering Network","date":"2023-04-02","arxiv_id":"2304.00429","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/information-recovery-driven-deep-incomplete#ran","syntology_url":"https://syntology.ai/paper/2304.00429","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.00429"}},"official":{"repos":["justsmart/RecFormer","justsmart/Recformer-mindspore"],"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/croc-cross-view-online-clustering-for-dense","slug":"croc-cross-view-online-clustering-for-dense","title":"CrOC: Cross-View Online Clustering for Dense Visual Representation Learning","date":"2023-03-23","arxiv_id":"2303.13245","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/croc-cross-view-online-clustering-for-dense#ran","syntology_url":"https://syntology.ai/paper/2303.13245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.13245"}},"official":{"repos":["stegmuel/croc"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/large-scale-education-reform-in-general","slug":"large-scale-education-reform-in-general","title":"Large-Scale Education Reform in General Equilibrium: Regression Discontinuity Evidence from India: Comment","date":"2023-03-21","arxiv_id":"2303.11956","repositories_listed":2,"syntology":null},{"url":"/paper/image-as-set-of-points","slug":"image-as-set-of-points","title":"Image as Set of Points","date":"2023-03-02","arxiv_id":"2303.01494","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":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/image-as-set-of-points#ran","syntology_url":"https://syntology.ai/paper/2303.01494","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.01494"}},"official":{"repos":["ma-xu/context-cluster"],"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/t-phenotype-discovering-phenotypes-of","slug":"t-phenotype-discovering-phenotypes-of","title":"T-Phenotype: Discovering Phenotypes of Predictive Temporal Patterns in Disease Progression","date":"2023-02-24","arxiv_id":"2302.12619","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/t-phenotype-discovering-phenotypes-of#ran","syntology_url":"https://syntology.ai/paper/2302.12619","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.12619"}},"official":{"repos":["vanderschaarlab/tphenotype","yvchao/tphenotype"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/automated-gadget-discovery-in-science","slug":"automated-gadget-discovery-in-science","title":"Automated Gadget Discovery in Science","date":"2022-12-24","arxiv_id":"2212.12743","repositories_listed":2,"syntology":null},{"url":"/paper/stop-using-the-elbow-criterion-for-k-means","slug":"stop-using-the-elbow-criterion-for-k-means","title":"Stop using the elbow criterion for k-means and how to choose the number of clusters instead","date":"2022-12-23","arxiv_id":"2212.12189","repositories_listed":2,"syntology":null},{"url":"/paper/hard-sample-aware-network-for-contrastive","slug":"hard-sample-aware-network-for-contrastive","title":"Hard Sample Aware Network for Contrastive Deep Graph Clustering","date":"2022-12-16","arxiv_id":"2212.08665","repositories_listed":2,"syntology":null},{"url":"/paper/contrastive-deep-graph-clustering-with","slug":"contrastive-deep-graph-clustering-with","title":"GraphLearner: Graph Node Clustering with Fully Learnable Augmentation","date":"2022-12-07","arxiv_id":"2212.03559","repositories_listed":2,"syntology":null},{"url":"/paper/optimal-sparse-regression-trees","slug":"optimal-sparse-regression-trees","title":"Optimal Sparse Regression Trees","date":"2022-11-28","arxiv_id":"2211.14980","repositories_listed":2,"syntology":null},{"url":"/paper/a-survey-of-deep-graph-clustering-taxonomy","slug":"a-survey-of-deep-graph-clustering-taxonomy","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","date":"2022-11-23","arxiv_id":"2211.12875","repositories_listed":2,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/a-survey-of-deep-graph-clustering-taxonomy#ran","syntology_url":"https://syntology.ai/paper/2211.12875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.12875"}},"official":{"repos":["marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering","yueliu1999/awesome-deep-graph-clustering"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/twin-contrastive-learning-for-online","slug":"twin-contrastive-learning-for-online","title":"Twin Contrastive Learning for Online Clustering","date":"2022-10-21","arxiv_id":"2210.11680","repositories_listed":2,"syntology":null},{"url":"/paper/brain-network-transformer","slug":"brain-network-transformer","title":"Brain Network Transformer","date":"2022-10-13","arxiv_id":"2210.06681","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 1 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) · 4 unverified","sample_list":"/paper/brain-network-transformer#ran","syntology_url":"https://syntology.ai/paper/2210.06681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06681"}},"official":{"repos":["hennyjie/braingb","wayfear/brainnetworktransformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/rudsi-graph-based-word-sense-induction","slug":"rudsi-graph-based-word-sense-induction","title":"RuDSI: graph-based word sense induction dataset for Russian","date":"2022-09-28","arxiv_id":"2209.13750","repositories_listed":2,"syntology":null},{"url":"/paper/clustering-by-direct-optimization-of-the","slug":"clustering-by-direct-optimization-of-the","title":"Clustering by Direct Optimization of the Medoid Silhouette","date":"2022-09-26","arxiv_id":"2209.12553","repositories_listed":2,"syntology":null},{"url":"/paper/clusterbma-bayesian-model-averaging-for","slug":"clusterbma-bayesian-model-averaging-for","title":"clusterBMA: Bayesian model averaging for clustering","date":"2022-09-09","arxiv_id":"2209.04117","repositories_listed":2,"syntology":null},{"url":"/paper/automating-dbscan-via-deep-reinforcement","slug":"automating-dbscan-via-deep-reinforcement","title":"Automating DBSCAN via Deep Reinforcement Learning","date":"2022-08-09","arxiv_id":"2208.04537","repositories_listed":2,"syntology":null},{"url":"/paper/class-incremental-learning-with-cross-space","slug":"class-incremental-learning-with-cross-space","title":"Class-Incremental Learning with Cross-Space Clustering and Controlled Transfer","date":"2022-08-07","arxiv_id":"2208.03767","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/class-incremental-learning-with-cross-space#ran","syntology_url":"https://syntology.ai/paper/2208.03767","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.03767"}},"official":{"repos":["ashok-arjun/CSCCT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/differentially-private-vertical-federated","slug":"differentially-private-vertical-federated","title":"Differentially Private Vertical Federated Clustering","date":"2022-08-02","arxiv_id":"2208.01700","repositories_listed":2,"syntology":null},{"url":"/paper/multi-view-clustering-for-open-knowledge-base","slug":"multi-view-clustering-for-open-knowledge-base","title":"Multi-View Clustering for Open Knowledge Base Canonicalization","date":"2022-06-22","arxiv_id":"2206.11130","repositories_listed":2,"syntology":null},{"url":"/paper/cmt-deeplab-clustering-mask-transformers-for-1","slug":"cmt-deeplab-clustering-mask-transformers-for-1","title":"CMT-DeepLab: Clustering Mask Transformers for Panoptic Segmentation","date":"2022-06-17","arxiv_id":"2206.08948","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/cmt-deeplab-clustering-mask-transformers-for-1#ran","syntology_url":"https://syntology.ai/paper/2206.08948","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08948"}},"official":null}},{"url":"/paper/dual-contrastive-attributed-graph-clustering","slug":"dual-contrastive-attributed-graph-clustering","title":"NCAGC: A Neighborhood Contrast Framework for Attributed Graph Clustering","date":"2022-06-16","arxiv_id":"2206.07897","repositories_listed":2,"syntology":null},{"url":"/paper/ccp-correlated-clustering-and-projection-for","slug":"ccp-correlated-clustering-and-projection-for","title":"CCP: Correlated Clustering and Projection for Dimensionality Reduction","date":"2022-06-08","arxiv_id":"2206.04189","repositories_listed":2,"syntology":null},{"url":"/paper/bigc-rapid-scalable-and-accurate-clustering","slug":"bigc-rapid-scalable-and-accurate-clustering","title":"Secuer: ultrafast, scalable and accurate clustering of single-cell RNA-seq data","date":"2022-05-25","arxiv_id":"2205.12432","repositories_listed":2,"syntology":null},{"url":"/paper/scene-clustering-based-pseudo-labeling","slug":"scene-clustering-based-pseudo-labeling","title":"Scene Clustering Based Pseudo-labeling Strategy for Multi-modal Aerial View Object Classification","date":"2022-05-04","arxiv_id":"2205.01920","repositories_listed":2,"syntology":null},{"url":"/paper/on-the-representation-collapse-of-sparse","slug":"on-the-representation-collapse-of-sparse","title":"On the Representation Collapse of Sparse Mixture of Experts","date":"2022-04-20","arxiv_id":"2204.09179","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-the-representation-collapse-of-sparse#ran","syntology_url":"https://syntology.ai/paper/2204.09179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.09179"}},"official":{"repos":["microsoft/unilm"],"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/attributed-graph-clustering-with-dual","slug":"attributed-graph-clustering-with-dual","title":"Attributed Graph Clustering with Dual Redundancy Reduction","date":"2022-04-18","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/eigenlanes-data-driven-lane-descriptors-for","slug":"eigenlanes-data-driven-lane-descriptors-for","title":"Eigenlanes: Data-Driven Lane Descriptors for Structurally Diverse Lanes","date":"2022-03-29","arxiv_id":"2203.15302","repositories_listed":2,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/eigenlanes-data-driven-lane-descriptors-for#ran","syntology_url":"https://syntology.ai/paper/2203.15302","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15302"}},"official":{"repos":["dongkwonjin/eigenlanes"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/selective-inference-for-k-means-clustering","slug":"selective-inference-for-k-means-clustering","title":"Selective inference for k-means clustering","date":"2022-03-29","arxiv_id":"2203.15267","repositories_listed":2,"syntology":null}],"record_sha256":"6f73f015cdc14e3550ab40e844355f226f5f0ac6299f00d91e7ab076fb5aa162","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}