{"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/11","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":11,"pages_in_order":108,"rows_per_page":100,"rows":[1001,1100],"of":10718,"counts":{"archive_papers_tagged":10718,"with_a_code_link":2823,"where_syntology_ran_a_sample":419,"not_listed_spam_title":0,"listed":10718,"listed_where_code_ran":419,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":335,"every_run_a_failure_of_syntologys_instrument":84,"listed_with_a_run_with_no_instrument_failure":335,"listed_every_run_a_failure_of_syntologys_instrument":84,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/clustering","prev":"/task/clustering/papers/10","next":"/task/clustering/papers/12","papers":[{"url":"/paper/dynamic-clustering-and-cluster-contrastive","slug":"dynamic-clustering-and-cluster-contrastive","title":"Dynamic Clustering and Cluster Contrastive Learning for Unsupervised Person Re-identification","date":"2023-03-13","arxiv_id":"2303.06810","repositories_listed":1,"syntology":null},{"url":"/paper/elc-ois-ellipsoidal-clustering-for-open-world","slug":"elc-ois-ellipsoidal-clustering-for-open-world","title":"ElC-OIS: Ellipsoidal Clustering for Open-World Instance Segmentation on LiDAR Data","date":"2023-03-08","arxiv_id":"2303.04351","repositories_listed":1,"syntology":null},{"url":"/paper/point-cloud-classification-using-content","slug":"point-cloud-classification-using-content","title":"Point Cloud Classification Using Content-based Transformer via Clustering in Feature Space","date":"2023-03-08","arxiv_id":"2303.04599","repositories_listed":1,"syntology":null},{"url":"/paper/a-hybrid-architecture-for-out-of-domain","slug":"a-hybrid-architecture-for-out-of-domain","title":"A Hybrid Architecture for Out of Domain Intent Detection and Intent Discovery","date":"2023-03-07","arxiv_id":"2303.04134","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-large-3d-volumes-a-sampling-based","slug":"clustering-large-3d-volumes-a-sampling-based","title":"Clustering large 3D volumes: A sampling-based approach","date":"2023-03-07","arxiv_id":"2303.04188","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-hierarchical-clustering","slug":"contrastive-hierarchical-clustering","title":"Contrastive Hierarchical Clustering","date":"2023-03-03","arxiv_id":"2303.03389","repositories_listed":1,"syntology":null},{"url":"/paper/domain-aware-triplet-loss-in-domain","slug":"domain-aware-triplet-loss-in-domain","title":"Domain-aware Triplet loss in Domain Generalization","date":"2023-03-01","arxiv_id":"2303.01233","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"9 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/domain-aware-triplet-loss-in-domain#ran","syntology_url":"https://syntology.ai/paper/2303.01233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.01233"}},"official":{"repos":["workerbcd/dct"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-parameter-free-graph-reduction-for-spectral","slug":"a-parameter-free-graph-reduction-for-spectral","title":"A parameter-free graph reduction for spectral clustering and SpectralNet","date":"2023-02-25","arxiv_id":"2302.13165","repositories_listed":1,"syntology":null},{"url":"/paper/random-projection-tree-similarity-metric-for","slug":"random-projection-tree-similarity-metric-for","title":"Random projection tree similarity metric for SpectralNet","date":"2023-02-25","arxiv_id":"2302.13168","repositories_listed":1,"syntology":null},{"url":"/paper/supervised-hierarchical-clustering-using","slug":"supervised-hierarchical-clustering-using","title":"Supervised Hierarchical Clustering using Graph Neural Networks for Speaker Diarization","date":"2023-02-24","arxiv_id":"2302.12716","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-domain-adaptation-via-distilled","slug":"unsupervised-domain-adaptation-via-distilled","title":"Unsupervised Domain Adaptation via Distilled Discriminative Clustering","date":"2023-02-23","arxiv_id":"2302.11984","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unsupervised-domain-adaptation-via-distilled#ran","syntology_url":"https://syntology.ai/paper/2302.11984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.11984"}},"official":{"repos":["huitangtang/disclusterda"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/approximate-spectral-clustering-density-based","slug":"approximate-spectral-clustering-density-based","title":"Approximate spectral clustering density-based similarity for noisy datasets","date":"2023-02-22","arxiv_id":"2302.11298","repositories_listed":1,"syntology":null},{"url":"/paper/approximate-spectral-clustering-with","slug":"approximate-spectral-clustering-with","title":"Approximate spectral clustering with eigenvector selection and self-tuned $k$","date":"2023-02-22","arxiv_id":"2302.11297","repositories_listed":1,"syntology":null},{"url":"/paper/refining-a-k-nearest-neighbor-graph-for-a","slug":"refining-a-k-nearest-neighbor-graph-for-a","title":"Refining a $k$-nearest neighbor graph for a computationally efficient spectral clustering","date":"2023-02-22","arxiv_id":"2302.11296","repositories_listed":1,"syntology":null},{"url":"/paper/classy-ensemble-a-novel-ensemble-algorithm","slug":"classy-ensemble-a-novel-ensemble-algorithm","title":"Classy Ensemble: A Novel Ensemble Algorithm for Classification","date":"2023-02-21","arxiv_id":"2302.10580","repositories_listed":1,"syntology":null},{"url":"/paper/joint-optimization-of-base-station-clustering","slug":"joint-optimization-of-base-station-clustering","title":"Joint Optimization of Base Station Clustering and Service Caching in User-Centric MEC","date":"2023-02-21","arxiv_id":"2302.10558","repositories_listed":1,"syntology":null},{"url":"/paper/replicable-clustering","slug":"replicable-clustering","title":"Replicable Clustering","date":"2023-02-20","arxiv_id":"2302.10359","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-back-ends-for-online-speaker","slug":"probabilistic-back-ends-for-online-speaker","title":"Probabilistic Back-ends for Online Speaker Recognition and Clustering","date":"2023-02-19","arxiv_id":"2302.09523","repositories_listed":1,"syntology":null},{"url":"/paper/clucdd-contrastive-dialogue-disentanglement","slug":"clucdd-contrastive-dialogue-disentanglement","title":"CluCDD:Contrastive Dialogue Disentanglement via Clustering","date":"2023-02-16","arxiv_id":"2302.08146","repositories_listed":1,"syntology":null},{"url":"/paper/kernelized-diffusion-maps","slug":"kernelized-diffusion-maps","title":"Kernelized Diffusion maps","date":"2023-02-13","arxiv_id":"2302.06757","repositories_listed":1,"syntology":null},{"url":"/paper/online-arbitrary-shaped-clustering-through","slug":"online-arbitrary-shaped-clustering-through","title":"Online Arbitrary Shaped Clustering through Correlated Gaussian Functions","date":"2023-02-13","arxiv_id":"2302.06335","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-detection-of-behavioural-drifts","slug":"unsupervised-detection-of-behavioural-drifts","title":"Unsupervised Detection of Behavioural Drifts with Dynamic Clustering and Trajectory Analysis","date":"2023-02-13","arxiv_id":"2302.06228","repositories_listed":1,"syntology":null},{"url":"/paper/an-unsupervised-learning-approach-for-1","slug":"an-unsupervised-learning-approach-for-1","title":"An unsupervised learning approach for predicting wind farm power and downstream wakes using weather patterns","date":"2023-02-12","arxiv_id":"2302.05886","repositories_listed":1,"syntology":null},{"url":"/paper/robust-representation-learning-by-clustering","slug":"robust-representation-learning-by-clustering","title":"Robust Representation Learning by Clustering with Bisimulation Metrics for Visual Reinforcement Learning with Distractions","date":"2023-02-12","arxiv_id":"2302.12003","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-aware-multi-view-clustering","slug":"fairness-aware-multi-view-clustering","title":"Fairness-aware Multi-view Clustering","date":"2023-02-11","arxiv_id":"2302.05788","repositories_listed":1,"syntology":null},{"url":"/paper/neural-capacitated-clustering","slug":"neural-capacitated-clustering","title":"Neural Capacitated Clustering","date":"2023-02-10","arxiv_id":"2302.05134","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-select-pivotal-samples-for-meta","slug":"learning-to-select-pivotal-samples-for-meta","title":"Learning to Select Pivotal Samples for Meta Re-weighting","date":"2023-02-09","arxiv_id":"2302.04418","repositories_listed":1,"syntology":null},{"url":"/paper/principled-and-efficient-motif-finding-for","slug":"principled-and-efficient-motif-finding-for","title":"Principled and Efficient Motif Finding for Structure Learning of Lifted Graphical Models","date":"2023-02-09","arxiv_id":"2302.04599","repositories_listed":1,"syntology":null},{"url":"/paper/rmultinet-an-r-package-for-multilayer","slug":"rmultinet-an-r-package-for-multilayer","title":"rMultiNet: An R Package For Multilayer Networks Analysis","date":"2023-02-09","arxiv_id":"2302.04437","repositories_listed":1,"syntology":null},{"url":"/paper/high-resolution-gan-inversion-for-degraded","slug":"high-resolution-gan-inversion-for-degraded","title":"High-Resolution GAN Inversion for Degraded Images in Large Diverse Datasets","date":"2023-02-07","arxiv_id":"2302.03406","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/high-resolution-gan-inversion-for-degraded#ran","syntology_url":"https://syntology.ai/paper/2302.03406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03406"}},"official":{"repos":["booooooooooo/cri"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/intrinsic-rewards-from-self-organizing","slug":"intrinsic-rewards-from-self-organizing","title":"Intrinsic Rewards from Self-Organizing Feature Maps for Exploration in Reinforcement Learning","date":"2023-02-06","arxiv_id":"2302.04125","repositories_listed":1,"syntology":null},{"url":"/paper/learned-accelerator-framework-for-angular","slug":"learned-accelerator-framework-for-angular","title":"Learned Accelerator Framework for Angular-Distance-Based High-Dimensional DBSCAN","date":"2023-02-06","arxiv_id":"2302.03136","repositories_listed":1,"syntology":null},{"url":"/paper/regularization-and-global-optimization-in","slug":"regularization-and-global-optimization-in","title":"Regularization and Optimization in Model-Based Clustering","date":"2023-02-05","arxiv_id":"2302.02450","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-hierarchical-clustering-using","slug":"unsupervised-hierarchical-clustering-using","title":"Unsupervised hierarchical clustering using the learning dynamics of RBMs","date":"2023-02-03","arxiv_id":"2302.01851","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-attributed-graph-subspace-clustering","slug":"scalable-attributed-graph-subspace-clustering","title":"Scalable Attributed-Graph Subspace Clustering","date":"2023-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/simultaneous-linear-multi-view-attributed","slug":"simultaneous-linear-multi-view-attributed","title":"Simultaneous Linear Multi-view Attributed Graph Representation Learning and Clustering","date":"2023-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/contrast-and-clustering-learning-neighborhood","slug":"contrast-and-clustering-learning-neighborhood","title":"Contrast and Clustering: Learning Neighborhood Pair Representation for Source-free Domain Adaptation","date":"2023-01-31","arxiv_id":"2301.13428","repositories_listed":1,"syntology":null},{"url":"/paper/differentially-private-hierarchical","slug":"differentially-private-hierarchical","title":"Differentially-Private Hierarchical Clustering with Provable Approximation Guarantees","date":"2023-01-31","arxiv_id":"2302.00037","repositories_listed":1,"syntology":null},{"url":"/paper/domain-generalizable-multiple-domain","slug":"domain-generalizable-multiple-domain","title":"Domain-Generalizable Multiple-Domain Clustering","date":"2023-01-31","arxiv_id":"2301.13530","repositories_listed":1,"syntology":null},{"url":"/paper/fedconceptem-robust-federated-learning-under","slug":"fedconceptem-robust-federated-learning-under","title":"FedRC: Tackling Diverse Distribution Shifts Challenge in Federated Learning by Robust Clustering","date":"2023-01-29","arxiv_id":"2301.12379","repositories_listed":1,"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":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) · 3 unverified","sample_list":"/paper/fedconceptem-robust-federated-learning-under#ran","syntology_url":"https://syntology.ai/paper/2301.12379","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.12379"}},"official":{"repos":["lins-lab/fedrc"],"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/clusterfug-clustering-fully-connected-graphs","slug":"clusterfug-clustering-fully-connected-graphs","title":"ClusterFuG: Clustering Fully connected Graphs by Multicut","date":"2023-01-28","arxiv_id":"2301.12159","repositories_listed":1,"syntology":null},{"url":"/paper/deep-clustering-survival-machines-with","slug":"deep-clustering-survival-machines-with","title":"Deep Clustering Survival Machines with Interpretable Expert Distributions","date":"2023-01-27","arxiv_id":"2301.11826","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/deep-clustering-survival-machines-with#ran","syntology_url":"https://syntology.ai/paper/2301.11826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.11826"}},"official":{"repos":["bojianhou/dcsm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/incomplete-multi-view-clustering-via","slug":"incomplete-multi-view-clustering-via","title":"Incomplete Multi-view Clustering via Prototype-based Imputation","date":"2023-01-26","arxiv_id":"2301.11045","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"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) · 5 unverified","sample_list":"/paper/incomplete-multi-view-clustering-via#ran","syntology_url":"https://syntology.ai/paper/2301.11045","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.11045"}},"official":{"repos":["XLearning-SCU/2023-IJCAI-ProImp"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/exact-and-rapid-linear-clustering-of-networks","slug":"exact-and-rapid-linear-clustering-of-networks","title":"Exact and rapid linear clustering of networks with dynamic programming","date":"2023-01-25","arxiv_id":"2301.10403","repositories_listed":1,"syntology":null},{"url":"/paper/auto-weighted-multi-view-clustering-for-large","slug":"auto-weighted-multi-view-clustering-for-large","title":"Auto-weighted Multi-view Clustering for Large-scale Data","date":"2023-01-21","arxiv_id":"2303.01983","repositories_listed":1,"syntology":null},{"url":"/paper/min-max-jump-distance-and-its-applications","slug":"min-max-jump-distance-and-its-applications","title":"Min-Max-Jump distance and its applications","date":"2023-01-15","arxiv_id":"2301.05994","repositories_listed":1,"syntology":null},{"url":"/paper/density-based-clustering-with-fully","slug":"density-based-clustering-with-fully","title":"Density-based clustering with fully-convolutional networks for crowd flow detection from drones","date":"2023-01-12","arxiv_id":"2301.04937","repositories_listed":1,"syntology":null},{"url":"/paper/fast-conformational-clustering-of-extensive","slug":"fast-conformational-clustering-of-extensive","title":"Fast conformational clustering of extensive molecular dynamics simulation data","date":"2023-01-11","arxiv_id":"2301.04492","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-tri-stream-clustering-network","slug":"heterogeneous-tri-stream-clustering-network","title":"Heterogeneous Tri-stream Clustering Network","date":"2023-01-11","arxiv_id":"2301.04451","repositories_listed":1,"syntology":null},{"url":"/paper/universal-detection-of-backdoor-attacks-via","slug":"universal-detection-of-backdoor-attacks-via","title":"Universal Detection of Backdoor Attacks via Density-based Clustering and Centroids Analysis","date":"2023-01-11","arxiv_id":"2301.04554","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-functional-connectivity","slug":"dynamic-functional-connectivity","title":"Dynamic Functional Connectivity","date":"2023-01-09","arxiv_id":"2301.03408","repositories_listed":1,"syntology":null},{"url":"/paper/learning-the-relation-between-similarity-loss","slug":"learning-the-relation-between-similarity-loss","title":"Learning the Relation between Similarity Loss and Clustering Loss in Self-Supervised Learning","date":"2023-01-08","arxiv_id":"2301.03041","repositories_listed":1,"syntology":null},{"url":"/paper/randomized-greedy-algorithms-and-composable","slug":"randomized-greedy-algorithms-and-composable","title":"Randomized Greedy Algorithms and Composable Coreset for k-Center Clustering with Outliers","date":"2023-01-07","arxiv_id":"2301.02814","repositories_listed":1,"syntology":null},{"url":"/paper/adaptively-clustering-neighbor-elements-for","slug":"adaptively-clustering-neighbor-elements-for","title":"Adaptively Clustering Neighbor Elements for Image-Text Generation","date":"2023-01-05","arxiv_id":"2301.01955","repositories_listed":1,"syntology":null},{"url":"/paper/cluster-guided-contrastive-graph-clustering","slug":"cluster-guided-contrastive-graph-clustering","title":"Cluster-guided Contrastive Graph Clustering Network","date":"2023-01-03","arxiv_id":"2301.01098","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"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 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/cluster-guided-contrastive-graph-clustering#ran","syntology_url":"https://syntology.ai/paper/2301.01098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.01098"}},"official":{"repos":["xihongyang1999/ccgc"],"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":["official"]}}},{"url":"/paper/g-ceals-gaussian-cluster-embedding-in","slug":"g-ceals-gaussian-cluster-embedding-in","title":"Deep Clustering of Tabular Data by Weighted Gaussian Distribution Learning","date":"2023-01-02","arxiv_id":"2301.00802","repositories_listed":1,"syntology":null},{"url":"/paper/correlation-clustering-algorithm-for-dynamic","slug":"correlation-clustering-algorithm-for-dynamic","title":"Correlation Clustering Algorithm for Dynamic Complete Signed Graphs: An Index-based Approach","date":"2023-01-01","arxiv_id":"2301.00384","repositories_listed":1,"syntology":null},{"url":"/paper/explaining-adversarial-robustness-of-neural","slug":"explaining-adversarial-robustness-of-neural","title":"Explaining Adversarial Robustness of Neural Networks from Clustering Effect Perspective","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/highly-confident-local-structure-based","slug":"highly-confident-local-structure-based","title":"Highly Confident Local Structure Based Consensus Graph Learning for Incomplete Multi-View Clustering","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/local-connectivity-based-density-estimation","slug":"local-connectivity-based-density-estimation","title":"Local Connectivity-Based Density Estimation for Face Clustering","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pointclustering-unsupervised-point-cloud-pre","slug":"pointclustering-unsupervised-point-cloud-pre","title":"PointClustering: Unsupervised Point Cloud Pre-Training Using Transformation Invariance in Clustering","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pointdc-unsupervised-semantic-segmentation-of","slug":"pointdc-unsupervised-semantic-segmentation-of","title":"PointDC: Unsupervised Semantic Segmentation of 3D Point Clouds via Cross-Modal Distillation and Super-Voxel Clustering","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-4d-lidar-moving-object","slug":"unsupervised-4d-lidar-moving-object","title":"Unsupervised 4D LiDAR Moving Object Segmentation in Stationary Settings with Multivariate Occupancy Time Series","date":"2022-12-30","arxiv_id":"2212.14750","repositories_listed":1,"syntology":null},{"url":"/paper/pccc-the-pairwise-confidence-constraints","slug":"pccc-the-pairwise-confidence-constraints","title":"An algorithm for clustering with confidence-based must-link and cannot-link constraints","date":"2022-12-29","arxiv_id":"2212.14437","repositories_listed":1,"syntology":null},{"url":"/paper/a-clustering-guided-contrastive-fusion-for","slug":"a-clustering-guided-contrastive-fusion-for","title":"A Clustering-guided Contrastive Fusion for Multi-view Representation Learning","date":"2022-12-28","arxiv_id":"2212.13726","repositories_listed":1,"syntology":null},{"url":"/paper/using-mm-principles-to-deal-with-incomplete","slug":"using-mm-principles-to-deal-with-incomplete","title":"Using MM principles to deal with incomplete data in K-means clustering","date":"2022-12-23","arxiv_id":"2212.12379","repositories_listed":1,"syntology":null},{"url":"/paper/siteferret-beyond-simple-pocket","slug":"siteferret-beyond-simple-pocket","title":"SiteFerret: beyond simple pocket identification in proteins","date":"2022-12-22","arxiv_id":"2212.11888","repositories_listed":1,"syntology":null},{"url":"/paper/timestamp-supervised-action-segmentation-in","slug":"timestamp-supervised-action-segmentation-in","title":"Timestamp-Supervised Action Segmentation from the Perspective of Clustering","date":"2022-12-22","arxiv_id":"2212.11694","repositories_listed":1,"syntology":null},{"url":"/paper/improving-narrative-relationship-embeddings","slug":"improving-narrative-relationship-embeddings","title":"Improving Narrative Relationship Embeddings by Training with Additional Inverse-Relationship Constraints","date":"2022-12-21","arxiv_id":"2212.11234","repositories_listed":1,"syntology":null},{"url":"/paper/very-large-language-model-as-a-unified","slug":"very-large-language-model-as-a-unified","title":"Very Large Language Model as a Unified Methodology of Text Mining","date":"2022-12-19","arxiv_id":"2212.09271","repositories_listed":1,"syntology":null},{"url":"/paper/memory-like-adaptive-modeling-multi-agent","slug":"memory-like-adaptive-modeling-multi-agent","title":"Adaptive Multi-Agent Continuous Learning System","date":"2022-12-15","arxiv_id":"2212.07646","repositories_listed":1,"syntology":null},{"url":"/paper/quantum-clustering-with-k-means-a-hybrid","slug":"quantum-clustering-with-k-means-a-hybrid","title":"Quantum Clustering with k-Means: a Hybrid Approach","date":"2022-12-13","arxiv_id":"2212.06691","repositories_listed":1,"syntology":null},{"url":"/paper/deepcut-unsupervised-segmentation-using-graph","slug":"deepcut-unsupervised-segmentation-using-graph","title":"DeepCut: Unsupervised Segmentation using Graph Neural Networks Clustering","date":"2022-12-12","arxiv_id":"2212.05853","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"8 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deepcut-unsupervised-segmentation-using-graph#ran","syntology_url":"https://syntology.ai/paper/2212.05853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.05853"}},"official":null}},{"url":"/paper/explainable-performance","slug":"explainable-performance","title":"Measuring the Driving Forces of Predictive Performance: Application to Credit Scoring","date":"2022-12-12","arxiv_id":"2212.05866","repositories_listed":1,"syntology":null},{"url":"/paper/a-distributed-block-chebyshev-davidson","slug":"a-distributed-block-chebyshev-davidson","title":"A Distributed Block Chebyshev-Davidson Algorithm for Parallel Spectral Clustering","date":"2022-12-08","arxiv_id":"2212.04443","repositories_listed":1,"syntology":null},{"url":"/paper/analysis-of-utterance-embeddings-and","slug":"analysis-of-utterance-embeddings-and","title":"Analysis of Utterance Embeddings and Clustering Methods Related to Intent Induction for Task-Oriented Dialogue","date":"2022-12-05","arxiv_id":"2212.02021","repositories_listed":1,"syntology":null},{"url":"/paper/mhccl-masked-hierarchical-cluster-wise","slug":"mhccl-masked-hierarchical-cluster-wise","title":"MHCCL: Masked Hierarchical Cluster-Wise Contrastive Learning for Multivariate Time Series","date":"2022-12-02","arxiv_id":"2212.01141","repositories_listed":1,"syntology":null},{"url":"/paper/neural-radiance-fields-for-manhattan-scenes","slug":"neural-radiance-fields-for-manhattan-scenes","title":"Surface Normal Clustering for Implicit Representation of Manhattan Scenes","date":"2022-12-02","arxiv_id":"2212.01331","repositories_listed":1,"syntology":null},{"url":"/paper/a-revenue-function-for-comparison-based","slug":"a-revenue-function-for-comparison-based","title":"A Revenue Function for Comparison-Based Hierarchical Clustering","date":"2022-11-29","arxiv_id":"2211.16459","repositories_listed":1,"syntology":null},{"url":"/paper/sketch-and-solve-approaches-to-k-means","slug":"sketch-and-solve-approaches-to-k-means","title":"Sketch-and-solve approaches to k-means clustering by semidefinite programming","date":"2022-11-28","arxiv_id":"2211.15744","repositories_listed":1,"syntology":null},{"url":"/paper/patchgt-transformer-over-non-trainable","slug":"patchgt-transformer-over-non-trainable","title":"PatchGT: Transformer over Non-trainable Clusters for Learning Graph Representations","date":"2022-11-26","arxiv_id":"2211.14425","repositories_listed":1,"syntology":null},{"url":"/paper/fuzzy-clustering-for-the-within-season","slug":"fuzzy-clustering-for-the-within-season","title":"Fuzzy clustering for the within-season estimation of cotton phenology","date":"2022-11-25","arxiv_id":"2211.14099","repositories_listed":1,"syntology":null},{"url":"/paper/deduplication-over-heterogeneous-attribute","slug":"deduplication-over-heterogeneous-attribute","title":"Deduplication Over Heterogeneous Attribute Types (D-HAT)","date":"2022-11-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/global-k-means-an-effective-relaxation-of-the","slug":"global-k-means-an-effective-relaxation-of-the","title":"Global $k$-means$++$: an effective relaxation of the global $k$-means clustering algorithm","date":"2022-11-22","arxiv_id":"2211.12271","repositories_listed":1,"syntology":null},{"url":"/paper/mean-shift-mask-transformer-for-unseen-object","slug":"mean-shift-mask-transformer-for-unseen-object","title":"Mean Shift Mask Transformer for Unseen Object Instance Segmentation","date":"2022-11-21","arxiv_id":"2211.11679","repositories_listed":1,"syntology":null},{"url":"/paper/structural-optimization-of-factor-graphs-for","slug":"structural-optimization-of-factor-graphs-for","title":"Structural Optimization of Factor Graphs for Symbol Detection via Continuous Clustering and Machine Learning","date":"2022-11-21","arxiv_id":"2211.11406","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-extraction-labelling-and","slug":"unsupervised-extraction-labelling-and","title":"Unsupervised extraction, labelling and clustering of segments from clinical notes","date":"2022-11-21","arxiv_id":"2211.11799","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-local-cluster-extraction-by","slug":"semi-supervised-local-cluster-extraction-by","title":"Graph-based Semi-supervised Local Clustering with Few Labeled Nodes","date":"2022-11-20","arxiv_id":"2211.11114","repositories_listed":1,"syntology":null},{"url":"/paper/graph-augmentation-clustering-network","slug":"graph-augmentation-clustering-network","title":"EGRC-Net: Embedding-induced Graph Refinement Clustering Network","date":"2022-11-19","arxiv_id":"2211.10627","repositories_listed":1,"syntology":null},{"url":"/paper/region-embedding-with-intra-and-inter-view","slug":"region-embedding-with-intra-and-inter-view","title":"Region Embedding with Intra and Inter-View Contrastive Learning","date":"2022-11-15","arxiv_id":"2211.08975","repositories_listed":1,"syntology":null},{"url":"/paper/c3-cross-instance-guided-contrastive","slug":"c3-cross-instance-guided-contrastive","title":"C3: Cross-instance guided Contrastive Clustering","date":"2022-11-14","arxiv_id":"2211.07136","repositories_listed":1,"syntology":null},{"url":"/paper/seeded-iterative-clustering-for-histology","slug":"seeded-iterative-clustering-for-histology","title":"Seeded iterative clustering for histology region identification","date":"2022-11-14","arxiv_id":"2211.07425","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-with-total-variation-graph-neural","slug":"clustering-with-total-variation-graph-neural","title":"Total Variation Graph Neural Networks","date":"2022-11-11","arxiv_id":"2211.06218","repositories_listed":1,"syntology":null},{"url":"/paper/disc-differential-spectral-clustering-of","slug":"disc-differential-spectral-clustering-of","title":"DiSC: Differential Spectral Clustering of Features","date":"2022-11-10","arxiv_id":"2211.05314","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/disc-differential-spectral-clustering-of#ran","syntology_url":"https://syntology.ai/paper/2211.05314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.05314"}},"official":{"repos":["Mishne-Lab/DiSC"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-deep-learning-based-clustering","slug":"unsupervised-deep-learning-based-clustering","title":"Unsupervised Deep Learning-based clustering for Human Activity Recognition","date":"2022-11-10","arxiv_id":"2211.05483","repositories_listed":1,"syntology":null},{"url":"/paper/an-incremental-phase-mapping-approach-for-x","slug":"an-incremental-phase-mapping-approach-for-x","title":"An Incremental Phase Mapping Approach for X-ray Diffraction Patterns using Binary Peak Representations","date":"2022-11-08","arxiv_id":"2211.04011","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-of-countries-based-on-the","slug":"clustering-of-countries-based-on-the","title":"Clustering of countries based on the associated social contact patterns in epidemiological modelling","date":"2022-11-08","arxiv_id":"2211.06426","repositories_listed":1,"syntology":null},{"url":"/paper/doubly-inhomogeneous-reinforcement-learning","slug":"doubly-inhomogeneous-reinforcement-learning","title":"Doubly Inhomogeneous Reinforcement Learning","date":"2022-11-08","arxiv_id":"2211.03983","repositories_listed":1,"syntology":null},{"url":"/paper/significance-based-categorical-data","slug":"significance-based-categorical-data","title":"Significance-Based Categorical Data Clustering","date":"2022-11-08","arxiv_id":"2211.03956","repositories_listed":1,"syntology":null},{"url":"/paper/debiasing-graph-transfer-learning-via-item","slug":"debiasing-graph-transfer-learning-via-item","title":"Debiasing Graph Transfer Learning via Item Semantic Clustering for Cross-Domain Recommendations","date":"2022-11-07","arxiv_id":"2211.03390","repositories_listed":1,"syntology":null}],"record_sha256":"269bfbba28a5c4267fcec63b36556a20e1e884e00a8cff607d2789ddd6ad5052","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}