Spectral clustering and model reduction for weakly-connected coherent network systems

2022-09-27 · Hancheng Min, Enrique Mallada

We propose a novel model-reduction methodology for large-scale dynamic networks with tightly-connected components. First, the coherent groups are identified by a spectral clustering algorithm on the graph Laplacian matrix that models the network feedback. Then, a reduced network is built, where each node represents the aggregate dynamics of each coherent group, and the reduced network captures the dynamic coupling between the groups. Our approach is theoretically justified under a random graph setting. Finally, numerical experiments align with and validate our theoretical findings.

📄 PDF Abstract BibTeX arXiv:2209.13701

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Methods 이 논문이 사용한 방법론

ALIGN In the ALIGN method, visual and language representations are jointly trained from noisy image alt-text data. The image and text encoders are learned via contrastive loss…

Spectral Clustering Spectral clustering has attracted increasing attention due to the promising ability in dealing with nonlinearly separable datasets [15], [16]. In spectral clustering, the…

Learning Coherent Clusters in Weakly-Connected Network Systems

2022-11-28 · Hancheng Min, Enrique Mallada

We propose a structure-preserving model-reduction methodology for large-scale dynamic networks with tightly-connected components. First, the coherent groups are identified by a spectral clustering algorithm on the graph …

Clustering Stochastic Block Model

The Mathematics Behind Spectral Clustering And The Equivalence To PCA

2021-03-01 · T Shen

Spectral clustering is a popular algorithm that clusters points using the eigenvalues and eigenvectors of Laplacian matrices derived from the data. For years, spectral clustering has been working mysteriously. This paper…

Clustering Dimensionality Reduction

A parameter-free graph reduction for spectral clustering and SpectralNet

2023-02-25 · Mashaan Alshammari, John Stavrakakis, Masahiro Takatsuka

Graph-based clustering methods like spectral clustering and SpectralNet are very efficient in detecting clusters of non-convex shapes. Unlike the popular $k$-means, graph-based clustering methods do not assume that each …

Clustering Graph Clustering Graph Embedding graph partitioning+1

Incremental Graph Construction Enables Robust Spectral Clustering of Texts

2026-03-03 · Marko Pranjić, Boshko Koloski, Nada Lavrač, Senja Pollak 외 arxiv

Neighborhood graphs are a critical but often fragile step in spectral clustering of text embeddings. On realistic text datasets, standard $k$-NN graphs can contain many disconnected components at practical sparsity level…

MeanCut: A Greedy-Optimized Graph Clustering via Path-based Similarity and Degree Descent Criterion

2023-12-07 · Dehua Peng, Zhipeng Gui, Huayi Wu

As the most typical graph clustering method, spectral clustering is popular and attractive due to the remarkable performance, easy implementation, and strong adaptability. Classical spectral clustering measures the edge …

Clustering Face Recognition Graph Clustering