{"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/graph-clustering/papers/2","list_of":"/task/graph-clustering","task":"Graph 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":4,"rows_per_page":100,"rows":[101,200],"of":393,"counts":{"archive_papers_tagged":393,"with_a_code_link":180,"where_syntology_ran_a_sample":33,"not_listed_spam_title":0,"listed":393,"listed_where_code_ran":33,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":31,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":31,"listed_every_run_a_failure_of_syntologys_instrument":2,"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/graph-clustering","prev":"/task/graph-clustering","next":"/task/graph-clustering/papers/3","papers":[{"url":"/paper/variational-graph-generator-for-multi-view","slug":"variational-graph-generator-for-multi-view","title":"Variational Graph Generator for Multi-View Graph Clustering","date":"2022-10-13","arxiv_id":"2210.07011","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-block-contrastive-learning-via","slug":"efficient-block-contrastive-learning-via","title":"Efficient block contrastive learning via parameter-free meta-node approximation","date":"2022-09-28","arxiv_id":"2209.14067","repositories_listed":1,"syntology":null},{"url":"/paper/approximate-sampling-and-estimation-of","slug":"approximate-sampling-and-estimation-of","title":"Approximate sampling and estimation of partition functions using neural networks","date":"2022-09-21","arxiv_id":"2209.10423","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-symmetric-matrix-factorization-a","slug":"rethinking-symmetric-matrix-factorization-a","title":"Rethinking Symmetric Matrix Factorization: A More General and Better Clustering Perspective","date":"2022-09-06","arxiv_id":"2209.02528","repositories_listed":1,"syntology":null},{"url":"/paper/align-then-fusion-generalized-large-scale","slug":"align-then-fusion-generalized-large-scale","title":"Align then Fusion: Generalized Large-scale Multi-view Clustering with Anchor Matching Correspondences","date":"2022-05-30","arxiv_id":"2205.15075","repositories_listed":1,"syntology":null},{"url":"/paper/hippocluster-an-efficient-hippocampus","slug":"hippocluster-an-efficient-hippocampus","title":"Hippocluster: an efficient, hippocampus-inspired algorithm for graph clustering","date":"2022-05-19","arxiv_id":"2205.12338","repositories_listed":1,"syntology":null},{"url":"/paper/scgc-self-supervised-contrastive-graph","slug":"scgc-self-supervised-contrastive-graph","title":"SCGC : Self-Supervised Contrastive Graph Clustering","date":"2022-04-27","arxiv_id":"2204.12656","repositories_listed":1,"syntology":null},{"url":"/paper/simulate-time-integrated-coarse-grained","slug":"simulate-time-integrated-coarse-grained","title":"Simulate Time-integrated Coarse-grained Molecular Dynamics with Multi-Scale Graph Networks","date":"2022-04-21","arxiv_id":"2204.10348","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/simulate-time-integrated-coarse-grained#ran","syntology_url":"https://syntology.ai/paper/2204.10348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.10348"}},"official":{"repos":["kyonofx/mlcgmd"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cgc-contrastive-graph-clustering-for","slug":"cgc-contrastive-graph-clustering-for","title":"CGC: Contrastive Graph Clustering for Community Detection and Tracking","date":"2022-04-05","arxiv_id":"2204.08504","repositories_listed":1,"syntology":null},{"url":"/paper/smaragd-synthesized-smatch-for-accurate-and","slug":"smaragd-synthesized-smatch-for-accurate-and","title":"SMARAGD: Learning SMatch for Accurate and Rapid Approximate Graph Distance","date":"2022-03-24","arxiv_id":"2203.13226","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-graph-convolution-for-joint-node","slug":"efficient-graph-convolution-for-joint-node","title":"Efficient graph convolution for joint node representation learning and clustering","date":"2022-02-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/repbin-constraint-based-graph-representation","slug":"repbin-constraint-based-graph-representation","title":"RepBin: Constraint-based Graph Representation Learning for Metagenomic Binning","date":"2021-12-22","arxiv_id":"2112.11696","repositories_listed":1,"syntology":null},{"url":"/paper/deep-attention-guided-graph-clustering-with","slug":"deep-attention-guided-graph-clustering-with","title":"Deep Attention-guided Graph Clustering with Dual Self-supervision","date":"2021-11-10","arxiv_id":"2111.05548","repositories_listed":1,"syntology":null},{"url":"/paper/learning-co-segmentation-by-segment-swapping","slug":"learning-co-segmentation-by-segment-swapping","title":"Learning Co-segmentation by Segment Swapping for Retrieval and Discovery","date":"2021-10-29","arxiv_id":"2110.15904","repositories_listed":1,"syntology":null},{"url":"/paper/multi-view-contrastive-graph-clustering","slug":"multi-view-contrastive-graph-clustering","title":"Multi-view Contrastive Graph Clustering","date":"2021-10-22","arxiv_id":"2110.11842","repositories_listed":1,"syntology":null},{"url":"/paper/graphon-based-clustering-and-testing-of","slug":"graphon-based-clustering-and-testing-of","title":"Graphon based Clustering and Testing of Networks: Algorithms and Theory","date":"2021-10-06","arxiv_id":"2110.02722","repositories_listed":1,"syntology":null},{"url":"/paper/query-based-adversarial-attacks-on-graph-with","slug":"query-based-adversarial-attacks-on-graph-with","title":"Cluster Attack: Query-based Adversarial Attacks on Graphs with Graph-Dependent Priors","date":"2021-09-27","arxiv_id":"2109.13069","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-metric-learning-with-graph","slug":"self-supervised-metric-learning-with-graph","title":"Self-Supervised Metric Learning With Graph Clustering For Speaker Diarization","date":"2021-09-14","arxiv_id":"2109.06824","repositories_listed":1,"syntology":null},{"url":"/paper/rama-a-rapid-multicut-algorithm-on-gpu","slug":"rama-a-rapid-multicut-algorithm-on-gpu","title":"RAMA: A Rapid Multicut Algorithm on GPU","date":"2021-09-04","arxiv_id":"2109.01838","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-community-detection-via-parallel","slug":"scalable-community-detection-via-parallel","title":"Scalable Community Detection via Parallel Correlation Clustering","date":"2021-07-27","arxiv_id":"2108.01731","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-graph-autoencoder-models-for","slug":"rethinking-graph-autoencoder-models-for","title":"Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering","date":"2021-07-19","arxiv_id":"2107.08562","repositories_listed":1,"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/rethinking-graph-autoencoder-models-for#ran","syntology_url":"https://syntology.ai/paper/2107.08562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.08562"}},"official":{"repos":["nairouz/R-GAE"],"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/template-based-graph-clustering","slug":"template-based-graph-clustering","title":"Template-Based Graph Clustering","date":"2021-07-05","arxiv_id":"2107.01994","repositories_listed":1,"syntology":null},{"url":"/paper/latent-structure-blockmodels-for-bayesian","slug":"latent-structure-blockmodels-for-bayesian","title":"Latent structure blockmodels for Bayesian spectral graph clustering","date":"2021-07-04","arxiv_id":"2107.01734","repositories_listed":1,"syntology":null},{"url":"/paper/federated-graph-classification-over-non-iid","slug":"federated-graph-classification-over-non-iid","title":"Federated Graph Classification over Non-IID Graphs","date":"2021-06-25","arxiv_id":"2106.13423","repositories_listed":1,"syntology":null},{"url":"/paper/structure-aware-face-clustering-on-a-large-1","slug":"structure-aware-face-clustering-on-a-large-1","title":"Structure-Aware Face Clustering on a Large-Scale Graph With 107 Nodes","date":"2021-06-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/digrac-digraph-clustering-with-flow-imbalance","slug":"digrac-digraph-clustering-with-flow-imbalance","title":"DIGRAC: Digraph Clustering Based on Flow Imbalance","date":"2021-06-09","arxiv_id":"2106.05194","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/digrac-digraph-clustering-with-flow-imbalance#ran","syntology_url":"https://syntology.ai/paper/2106.05194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05194"}},"official":{"repos":["sherylhyx/digrac_directed_clustering"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/local-algorithms-for-finding-densely","slug":"local-algorithms-for-finding-densely","title":"Local Algorithms for Finding Densely Connected Clusters","date":"2021-06-09","arxiv_id":"2106.05245","repositories_listed":1,"syntology":{"n":15,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":10,"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) · 10 unverified","sample_list":"/paper/local-algorithms-for-finding-densely#ran","syntology_url":"https://syntology.ai/paper/2106.05245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05245"}},"official":{"repos":["pmacg/local-densely-connected-clusters"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/structure-aware-face-clustering-on-a-large","slug":"structure-aware-face-clustering-on-a-large","title":"Structure-Aware Face Clustering on a Large-Scale Graph with $\\bf{10^{7}}$ Nodes","date":"2021-03-24","arxiv_id":"2103.13225","repositories_listed":1,"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":3,"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/structure-aware-face-clustering-on-a-large#ran","syntology_url":"https://syntology.ai/paper/2103.13225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13225"}},"official":{"repos":["sstzal/STAR-FC"],"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":["official"]}}},{"url":"/paper/learning-a-proposal-classifier-for-multiple","slug":"learning-a-proposal-classifier-for-multiple","title":"Learning a Proposal Classifier for Multiple Object Tracking","date":"2021-03-14","arxiv_id":"2103.07889","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"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 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) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learning-a-proposal-classifier-for-multiple#ran","syntology_url":"https://syntology.ai/paper/2103.07889","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.07889"}},"official":{"repos":["daip13/LPC_MOT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/accurate-learning-of-graph-representations-1","slug":"accurate-learning-of-graph-representations-1","title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","date":"2021-02-23","arxiv_id":"2102.11533","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"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) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/accurate-learning-of-graph-representations-1#ran","syntology_url":"https://syntology.ai/paper/2102.11533","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11533"}},"official":{"repos":["JinheonBaek/GMT"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/refining-a-nearest-neighbor-graph-for-a","slug":"refining-a-nearest-neighbor-graph-for-a","title":"Refining a -nearest neighbor graph for a computationally efficient spectral clustering","date":"2021-02-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/improving-graph-representation-learning-by","slug":"improving-graph-representation-learning-by","title":"Calibrating and Improving Graph Contrastive Learning","date":"2021-01-27","arxiv_id":"2101.11525","repositories_listed":1,"syntology":null},{"url":"/paper/asymmetric-semi-nonnegative-matrix","slug":"asymmetric-semi-nonnegative-matrix","title":"Asymmetric Semi-Nonnegative Matrix Factorization for Directed Graph Clustering","date":"2020-12-31","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/asymmetric-semi-nonnegative-matrix-1","slug":"asymmetric-semi-nonnegative-matrix-1","title":"Asymmetric Semi-Nonnegative Matrix Factorization for Directed Graph Clustering","date":"2020-12-31","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/polaratio-a-magnitude-contingent-monotonic","slug":"polaratio-a-magnitude-contingent-monotonic","title":"Polaratio: A magnitude-contingent monotonic correlation metric and its improvements to scRNA-seq clustering","date":"2020-12-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-fusion-clustering-network","slug":"deep-fusion-clustering-network","title":"Deep Fusion Clustering Network","date":"2020-12-15","arxiv_id":"2012.09600","repositories_listed":1,"syntology":null},{"url":"/paper/mixed-membership-graph-clustering-via","slug":"mixed-membership-graph-clustering-via","title":"Mixed Membership Graph Clustering via Systematic Edge Query","date":"2020-11-25","arxiv_id":"2011.12988","repositories_listed":1,"syntology":null},{"url":"/paper/dirichlet-graph-variational-autoencoder","slug":"dirichlet-graph-variational-autoencoder","title":"Dirichlet Graph Variational Autoencoder","date":"2020-10-09","arxiv_id":"2010.04408","repositories_listed":1,"syntology":null},{"url":"/paper/incnsa-detecting-communities-incrementally","slug":"incnsa-detecting-communities-incrementally","title":"IncNSA: Detecting communities incrementally from time-evolving networks based on node similarity","date":"2020-07-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/strongly-local-p-norm-cut-algorithms-for-semi","slug":"strongly-local-p-norm-cut-algorithms-for-semi","title":"Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clustering","date":"2020-06-15","arxiv_id":"2006.08569","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-differentiable-multi-aspect","slug":"unsupervised-differentiable-multi-aspect","title":"Unsupervised Differentiable Multi-aspect Network Embedding","date":"2020-06-07","arxiv_id":"2006.04239","repositories_listed":1,"syntology":null},{"url":"/paper/comparison-and-benchmark-of-graph-clustering","slug":"comparison-and-benchmark-of-graph-clustering","title":"Comparison and Benchmark of Graph Clustering Algorithms","date":"2020-05-10","arxiv_id":"2005.04806","repositories_listed":1,"syntology":null},{"url":"/paper/incorporating-user-s-preference-into","slug":"incorporating-user-s-preference-into","title":"Incorporating User's Preference into Attributed Graph Clustering","date":"2020-03-24","arxiv_id":"2003.11079","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-graph-convolutional-network-with","slug":"adaptive-graph-convolutional-network-with","title":"Adaptive Graph Convolutional Network with Attention Graph Clustering for Co-saliency Detection","date":"2020-03-13","arxiv_id":"2003.06167","repositories_listed":1,"syntology":null},{"url":"/paper/neural-networks-are-surprisingly-modular","slug":"neural-networks-are-surprisingly-modular","title":"Pruned Neural Networks are Surprisingly Modular","date":"2020-03-10","arxiv_id":"2003.04881","repositories_listed":1,"syntology":null},{"url":"/paper/localized-flow-based-clustering-in","slug":"localized-flow-based-clustering-in","title":"Minimizing Localized Ratio Cut Objectives in Hypergraphs","date":"2020-02-21","arxiv_id":"2002.09441","repositories_listed":1,"syntology":null},{"url":"/paper/parameterized-objectives-and-algorithms-for","slug":"parameterized-objectives-and-algorithms-for","title":"Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs","date":"2020-02-21","arxiv_id":"2002.09460","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-distance-metric-learning-with","slug":"graph-neural-distance-metric-learning-with","title":"Graph Neural Distance Metric Learning with Graph-Bert","date":"2020-02-09","arxiv_id":"2002.03427","repositories_listed":1,"syntology":null},{"url":"/paper/p-norm-flow-diffusion-for-local-graph-1","slug":"p-norm-flow-diffusion-for-local-graph-1","title":"p-Norm Flow Diffusion for Local Graph Clustering","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-non-negative-symmetric-encoder-decoder","slug":"a-non-negative-symmetric-encoder-decoder","title":"A Non-negative Symmetric Encoder-Decoder Approach for Community Detection","date":"2019-12-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/balancing-the-tradeoff-between-clustering","slug":"balancing-the-tradeoff-between-clustering","title":"Balancing the Tradeoff Between Clustering Value and Interpretability","date":"2019-12-17","arxiv_id":"1912.07820","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/balancing-the-tradeoff-between-clustering#ran","syntology_url":"https://syntology.ai/paper/1912.07820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.07820"}},"official":{"repos":["sandysa/Interpretable_Clustering"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/gromov-wasserstein-factorization-models-for","slug":"gromov-wasserstein-factorization-models-for","title":"Gromov-Wasserstein Factorization Models for Graph Clustering","date":"2019-11-19","arxiv_id":"1911.08530","repositories_listed":1,"syntology":null},{"url":"/paper/correlation-clustering-with-same-cluster","slug":"correlation-clustering-with-same-cluster","title":"Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost","date":"2019-08-14","arxiv_id":"1908.04976","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/correlation-clustering-with-same-cluster#ran","syntology_url":"https://syntology.ai/paper/1908.04976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04976"}},"official":{"repos":["sanjayss34/corr-clust-query-esa2019"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rwr-gae-random-walk-regularization-for-graph","slug":"rwr-gae-random-walk-regularization-for-graph","title":"RWR-GAE: Random Walk Regularization for Graph Auto Encoders","date":"2019-08-12","arxiv_id":"1908.04003","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":5,"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, 1 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/rwr-gae-random-walk-regularization-for-graph#ran","syntology_url":"https://syntology.ai/paper/1908.04003","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.04003"}},"official":{"repos":["MysteryVaibhav/DW-GAE"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/symmetric-graph-convolutional-autoencoder-for","slug":"symmetric-graph-convolutional-autoencoder-for","title":"Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning","date":"2019-08-07","arxiv_id":"1908.02441","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/symmetric-graph-convolutional-autoencoder-for#ran","syntology_url":"https://syntology.ai/paper/1908.02441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.02441"}},"official":null}},{"url":"/paper/dante-deep-affinity-network-for-clustering","slug":"dante-deep-affinity-network-for-clustering","title":"Improving Social Awareness Through DANTE: A Deep Affinity Network for Clustering Conversational Interactants","date":"2019-07-24","arxiv_id":"1907.12910","repositories_listed":1,"syntology":null},{"url":"/paper/attributed-graph-clustering-via-adaptive","slug":"attributed-graph-clustering-via-adaptive","title":"Attributed Graph Clustering via Adaptive Graph Convolution","date":"2019-06-04","arxiv_id":"1906.01210","repositories_listed":1,"syntology":null},{"url":"/paper/discrete-optimal-graph-clustering","slug":"discrete-optimal-graph-clustering","title":"Discrete Optimal Graph Clustering","date":"2019-04-25","arxiv_id":"1904.11266","repositories_listed":1,"syntology":null},{"url":"/paper/simultaneous-dimensionality-and-complexity","slug":"simultaneous-dimensionality-and-complexity","title":"Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering","date":"2019-04-05","arxiv_id":"1904.02926","repositories_listed":1,"syntology":null},{"url":"/paper/an-internal-validity-index-based-on-density","slug":"an-internal-validity-index-based-on-density","title":"An Internal Validity Index Based on Density-Involved Distance","date":"2019-03-22","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-resolution-parameters-for-graph","slug":"learning-resolution-parameters-for-graph","title":"Learning Resolution Parameters for Graph Clustering","date":"2019-03-12","arxiv_id":"1903.05246","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-network-embedding-for-graph","slug":"unsupervised-network-embedding-for-graph","title":"Unsupervised Network Embedding for Graph Visualization, Clustering and Classification","date":"2019-02-25","arxiv_id":"1903.05980","repositories_listed":1,"syntology":null},{"url":"/paper/clear-a-consistent-lifting-embedding-and","slug":"clear-a-consistent-lifting-embedding-and","title":"CLEAR: A Consistent Lifting, Embedding, and Alignment Rectification Algorithm for Multi-View Data Association","date":"2019-02-06","arxiv_id":"1902.02256","repositories_listed":1,"syntology":null},{"url":"/paper/inferring-networks-from-random-walk-based","slug":"inferring-networks-from-random-walk-based","title":"Inferring Networks From Random Walk-Based Node Similarities","date":"2018-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-ensemble-based-on-a-bi-objective","slug":"an-ensemble-based-on-a-bi-objective","title":"An ensemble based on a bi-objective evolutionary spectral algorithm for graph clustering","date":"2018-10-08","arxiv_id":"1810.03652","repositories_listed":1,"syntology":null},{"url":"/paper/non-linear-attributed-graph-clustering-by","slug":"non-linear-attributed-graph-clustering-by","title":"Non-linear Attributed Graph Clustering by Symmetric NMF with PU Learning","date":"2018-09-21","arxiv_id":"1810.00946","repositories_listed":1,"syntology":null},{"url":"/paper/convolutional-neural-networks-for-fast","slug":"convolutional-neural-networks-for-fast","title":"Learning-based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set Matching","date":"2018-09-10","arxiv_id":"1809.04440","repositories_listed":1,"syntology":null},{"url":"/paper/a-projection-method-for-metric-constrained","slug":"a-projection-method-for-metric-constrained","title":"A Projection Method for Metric-Constrained Optimization","date":"2018-06-05","arxiv_id":"1806.01678","repositories_listed":1,"syntology":null},{"url":"/paper/the-power-mean-laplacian-for-multilayer-graph","slug":"the-power-mean-laplacian-for-multilayer-graph","title":"The Power Mean Laplacian for Multilayer Graph Clustering","date":"2018-03-01","arxiv_id":"1803.00491","repositories_listed":1,"syntology":null},{"url":"/paper/memetic-graph-clustering","slug":"memetic-graph-clustering","title":"Memetic Graph Clustering","date":"2018-02-20","arxiv_id":"1802.07034","repositories_listed":1,"syntology":null},{"url":"/paper/learning-networks-from-random-walk-based-node","slug":"learning-networks-from-random-walk-based-node","title":"Learning Networks from Random Walk-Based Node Similarities","date":"2018-01-23","arxiv_id":"1801.07386","repositories_listed":1,"syntology":null},{"url":"/paper/a-streaming-algorithm-for-graph-clustering","slug":"a-streaming-algorithm-for-graph-clustering","title":"A Streaming Algorithm for Graph Clustering","date":"2017-12-09","arxiv_id":"1712.04337","repositories_listed":1,"syntology":null},{"url":"/paper/affinity-clustering-hierarchical-clustering","slug":"affinity-clustering-hierarchical-clustering","title":"Affinity Clustering: Hierarchical Clustering at Scale","date":"2017-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/residual-gated-graph-convnets","slug":"residual-gated-graph-convnets","title":"Residual Gated Graph ConvNets","date":"2017-11-20","arxiv_id":"1711.07553","repositories_listed":1,"syntology":null},{"url":"/paper/when-slepian-meets-fiedler-putting-a-focus-on","slug":"when-slepian-meets-fiedler-putting-a-focus-on","title":"When Slepian Meets Fiedler: Putting a Focus on the Graph Spectrum","date":"2017-01-29","arxiv_id":"1701.08401","repositories_listed":1,"syntology":null},{"url":"/paper/amos-an-automated-model-order-selection","slug":"amos-an-automated-model-order-selection","title":"AMOS: An Automated Model Order Selection Algorithm for Spectral Graph Clustering","date":"2016-09-21","arxiv_id":"1609.06457","repositories_listed":1,"syntology":null},{"url":"/paper/phase-transitions-and-a-model-order-selection","slug":"phase-transitions-and-a-model-order-selection","title":"Phase Transitions and a Model Order Selection Criterion for Spectral Graph Clustering","date":"2016-04-11","arxiv_id":"1604.03159","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-theory-of-unsigned-and-signed-graphs","slug":"spectral-theory-of-unsigned-and-signed-graphs","title":"Spectral Theory of Unsigned and Signed Graphs. Applications to Graph Clustering: a Survey","date":"2016-01-18","arxiv_id":"1601.04692","repositories_listed":1,"syntology":null},{"url":"/paper/parallel-graph-partitioning-for-complex","slug":"parallel-graph-partitioning-for-complex","title":"Parallel Graph Partitioning for Complex Networks","date":"2014-04-18","arxiv_id":"1404.4797","repositories_listed":1,"syntology":null},{"url":"/paper/symmetric-nonnegative-matrix-factorization","slug":"symmetric-nonnegative-matrix-factorization","title":"Symmetric Nonnegative Matrix Factorization for Graph Clustering","date":"2012-02-27","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"2505-11182","title":"Imputation-free and Alignment-free: Incomplete Multi-view Clustering Driven by Consensus Semantic Learning","date":"2025-05-16","arxiv_id":"2505.11182","repositories_listed":0,"syntology":null},{"url":null,"slug":"rhomboid-tiling-for-geometric-graph-deep","title":"Rhomboid Tiling for Geometric Graph Deep Learning","date":"2025-05-14","arxiv_id":"2505.09586","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-geometric-approach-to-problems-in","title":"A Geometric Approach to Problems in Optimization and Data Science","date":"2025-04-22","arxiv_id":"2504.16270","repositories_listed":0,"syntology":null},{"url":null,"slug":"haeccity-open-vocabulary-scene-understanding","title":"HAECcity: Open-Vocabulary Scene Understanding of City-Scale Point Clouds with Superpoint Graph Clustering","date":"2025-04-18","arxiv_id":"2504.13590","repositories_listed":0,"syntology":null},{"url":null,"slug":"panogs-gaussian-based-panoptic-segmentation","title":"PanoGS: Gaussian-based Panoptic Segmentation for 3D Open Vocabulary Scene Understanding","date":"2025-03-23","arxiv_id":"2503.18107","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-cut-informed-graph-embedding-and","title":"Deep Cut-informed Graph Embedding and Clustering","date":"2025-03-09","arxiv_id":"2503.06635","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustre-streaming-graph-clustering-with-multi","title":"CluStRE: Streaming Graph Clustering with Multi-Stage Refinement","date":"2025-02-08","arxiv_id":"2502.06879","repositories_listed":0,"syntology":null},{"url":null,"slug":"slcgc-a-lightweight-self-supervised-low-pass","title":"SLCGC: A lightweight Self-supervised Low-pass Contrastive Graph Clustering Network for Hyperspectral Images","date":"2025-02-05","arxiv_id":"2502.03497","repositories_listed":0,"syntology":null},{"url":null,"slug":"modular-training-of-neural-networks-aids","title":"Modular Training of Neural Networks aids Interpretability","date":"2025-02-04","arxiv_id":"2502.02470","repositories_listed":0,"syntology":null},{"url":"/paper/deep-modularity-networks-with-diversity","slug":"deep-modularity-networks-with-diversity","title":"Deep Modularity Networks with Diversity--Preserving Regularization","date":"2025-01-23","arxiv_id":"2501.13451","repositories_listed":0,"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":0,"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/deep-modularity-networks-with-diversity#ran","syntology_url":"https://syntology.ai/paper/2501.13451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.13451"}},"official":null}},{"url":null,"slug":"adaptive-homophily-clustering-a-structure","title":"Adaptive Homophily Clustering: Structure Homophily Graph Learning with Adaptive Filter for Hyperspectral Image","date":"2025-01-03","arxiv_id":"2501.01595","repositories_listed":0,"syntology":null},{"url":null,"slug":"attribute-missing-multi-view-graph-clustering","title":"Attribute-Missing Multi-view Graph Clustering","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"thesaurus-contrastive-graph-clustering-by","title":"THESAURUS: Contrastive Graph Clustering by Swapping Fused Gromov-Wasserstein Couplings","date":"2024-12-16","arxiv_id":"2412.11550","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-up-graph-propagation-computation-on","title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach","date":"2024-12-14","arxiv_id":"2412.10789","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-traffic-element-based-streetlight","title":"Adaptive Traffic Element-Based Streetlight Control Using Neighbor Discovery Algorithm Based on IoT Events","date":"2024-12-02","arxiv_id":"2412.01035","repositories_listed":0,"syntology":null},{"url":null,"slug":"attributed-graph-clustering-via-generalized","title":"Attributed Graph Clustering via Generalized Quaternion Representation Learning","date":"2024-11-22","arxiv_id":"2411.14727","repositories_listed":0,"syntology":null},{"url":null,"slug":"attributed-graph-clustering-in-collaborative","title":"Attributed Graph Clustering in Collaborative Settings","date":"2024-11-19","arxiv_id":"2411.12329","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-optimal-transport-through-factor","title":"Low-Rank Optimal Transport through Factor Relaxation with Latent Coupling","date":"2024-11-15","arxiv_id":"2411.10555","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-parclusterers-benchmark-suite-pcbs-a-fine","title":"The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering","date":"2024-11-15","arxiv_id":"2411.10290","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiscale-graph-construction-using-non-local","title":"Multiscale Graph Construction Using Non-local Cluster Features","date":"2024-11-13","arxiv_id":"2411.08371","repositories_listed":0,"syntology":null}],"record_sha256":"4429619017953c77d10fdb9f5b88393eb31b4b7e761217f5ecd3422cd93c75d8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}