Browse State-of-the-Art › Spectral Graph Clustering

Spectral Graph Clustering

15 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28

Graphs

Benchmarks archive 2025-07-28

No benchmark for this task in the archive.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

No dataset record in the archive lists this task.

Subtasks archive 2025-07-28

No subtask under this task in the archive's task tree.

Papers archive 2025-07-28

archive papers tagged: 30 · with a code link: 15 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 30 tagged papers has a Syntology run on record

Page 1 of 1: papers 1 to 30 of 30, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.

Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.

  • 25 Feb 2023 1 repository listed
    We introduce a graph reduction method that does not require any parameters.
  • 25 Feb 2023 1 repository listed
    Our experiments revealed that SpectralNet produces better clustering accuracy using rpTree similarity metric compared to k-nn graph with a distance metric.
  • 22 Feb 2023 1 repository listed
    Also, CONN could be tricked by noisy density between clusters.
  • 22 Feb 2023 1 repository listed
    The recently emerged spectral clustering surpasses conventional clustering methods by detecting clusters of any shape without the convexity assumption.
  • 22 Feb 2023 1 repository listed
    We proposed a refined version of k-nearest neighbor graph, in which we keep data points and aggressively reduce number of edges for computational efficiency.
  • 29 Oct 2021 1 repository listed
    The goal of this work is to efficiently identify visually similar patterns in images, e. g. identifying an artwork detail copied between an engraving and an oil painting, or recognizing parts of a night-time photograph…
  • 4 Jul 2021 1 repository listed
    Furthermore, the presence of communities within the network might generate community-specific submanifold structures in the embedding, but this is not explicitly accounted for in most statistical models for networks.
  • 6 Feb 2021 1 repository listed
    We proposed a refined version of -nearest neighbor graph, in which we keep data points and aggressively reduce number of edges for computational efficiency.
  • 1 Aug 2019 1 repository listed
    The evidence accumulation model is an approach for collecting the information of base partitions in a clustering ensemble method, and can be viewed as a kernel transformation from the original data space to a…
  • 5 Apr 2019 1 repository listed
    The second contribution is a simultaneous model selection framework.
  • 22 Mar 2019 1 repository listed
    One reason is that the measure of cluster separation does not consider the impact of outliers and neighborhood clusters.
  • 6 Feb 2019 1 repository listed
    Many robotics applications require alignment and fusion of observations obtained at multiple views to form a global model of the environment.
  • 21 Sep 2016 1 repository listed
    One of the longstanding problems in spectral graph clustering (SGC) is the so-called model order selection problem: automated selection of the correct number of clusters.
  • 11 Apr 2016 1 repository listed
    One of the longstanding open problems in spectral graph clustering (SGC) is the so-called model order selection problem: automated selection of the correct number of clusters.
  • 27 Feb 2012 1 repository listed
    Unlike NMF, however, SymNMF is based on a similarity measure between data points, and factorizes a symmetric matrix containing pairwise similarity values (not necessarily nonnegative).
  • Modular Training of Neural Networks aids Interpretability
    4 Feb 2025 0 repositories listed
    An approach to improve neural network interpretability is via clusterability, i.e., splitting a model into disjoint clusters that can be studied independently.
  • Two to Five Truths in Non-Negative Matrix Factorization
    6 May 2023 0 repositories listed
    In this paper, we explore the role of matrix scaling on a matrix of counts when building a topic model using non-negative matrix factorization.
  • Learning a Fast 3D Spectral Approach to Object Segmentation and Tracking over Space and Time
    15 Dec 2022 0 repositories listed
    We pose video object segmentation as spectral graph clustering in space and time, with one graph node for each pixel and edges forming local space-time neighborhoods.
  • Minimalistic Unsupervised Learning with the Sparse Manifold Transform
    30 Sep 2022 0 repositories listed
    We describe a minimalistic and interpretable method for unsupervised learning, without resorting to data augmentation, hyperparameter tuning, or other engineering designs, that achieves performance close to the SOTA SSL…
  • Spectral Graph Clustering for Intentional Islanding Operations in Resilient Hybrid Energy Systems
    13 Mar 2022 0 repositories listed
    Establishing cleaner energy generation therefore improving the sustainability of the power system is a crucial task in this century, and one of the key strategies being pursued is to shift the dependence on fossil fuel…
  • Multiway p-spectral graph cuts on Grassmann manifolds
    30 Aug 2020 0 repositories listed
    Nonlinear reformulations of the spectral clustering method have gained a lot of recent attention due to their increased numerical benefits and their solid mathematical background.
  • Computing Nonlinear Eigenfunctions via Gradient Flow Extinction
    27 Feb 2019 0 repositories listed
    In this work we investigate the computation of nonlinear eigenfunctions via the extinction profiles of gradient flows.
  • On a 'Two Truths' Phenomenon in Spectral Graph Clustering
    23 Aug 2018 0 repositories listed
    Clustering is concerned with coherently grouping observations without any explicit concept of true groupings.
  • A Variational Image Segmentation Model based on Normalized Cut with Adaptive Similarity and Spatial Regularization
    6 Jun 2018 0 repositories listed
    Image segmentation is a fundamental research topic in image processing and computer vision.
  • A Theoretical Investigation of Graph Degree as an Unsupervised Normality Measure
    24 Jan 2018 0 repositories listed
    For a graph representation of a dataset, a straightforward normality measure for a sample can be its graph degree.
  • Revisiting Spectral Graph Clustering with Generative Community Models
    14 Sep 2017 0 repositories listed
    The methodology of community detection can be divided into two principles: imposing a network model on a given graph, or optimizing a designed objective function.
  • Multilayer Spectral Graph Clustering via Convex Layer Aggregation: Theory and Algorithms
    8 Aug 2017 0 repositories listed
    Multilayer graphs are commonly used for representing different relations between entities and handling heterogeneous data processing tasks.
  • Multilayer Spectral Graph Clustering via Convex Layer Aggregation
    23 Sep 2016 0 repositories listed
    Multilayer graphs are commonly used for representing different relations between entities and handling heterogeneous data processing tasks.
  • Information Recovery in Shuffled Graphs via Graph Matching
    8 May 2016 0 repositories listed
    While many multiple graph inference methodologies operate under the implicit assumption that an explicit vertex correspondence is known across the vertex sets of the graphs, in practice these correspondences may only be…
  • Efficient Eigen-updating for Spectral Graph Clustering
    7 Jan 2013 0 repositories listed
    Partitioning a graph into groups of vertices such that those within each group are more densely connected than vertices assigned to different groups, known as graph clustering, is often used to gain insight into the…

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections