This paper develops a multilayer spectral clustering method for heterogeneous data.
problem Clustering in multilayer graphs with varying layer weights and structures.
method Convex layer aggregation for multilayer spectral graph clustering (SGC).
result Phase transition analysis and automated cluster assignment with statistical guarantees.
This paper tackles multilayer graph clustering via convex layer aggregation.
problem Challenges in clustering multilayer graphs and combining information from each layer.
method Theoretical framework for multilayer spectral graph clustering via convex layer aggregation.
result Establishes a critical value on the noise level for reliable cluster separation.
Introduces a new method for clustering multilayer graphs.
problem How to merge information from different layers in multilayer graphs.
method Introduces a one-parameter family of matrix power means for merging Laplacians from different layers.
result The method allows for accurate recovery of ground truth clusters under various settings.
New method clusters multilayer graphs with missing nodes.
problem Clustering multilayer graphs with missing nodes.
method Proposes a new framework for multilayer graphs with missing nodes, extending clustering methods to handle incomplete data.
result Proves consistency results under the Multi-Layer Stochastic Block Model assumption and highlights promising performance on real datasets.
Proposes scalable SSC using randomized clustering and multilayer graphs.
problem Inability of SSC to scale to large data sets and robustness issues.
method Randomized hierarchical clustering for anchor points, multilayer graph construction, and k-means clustering. result Significantly improved scalability and robustness on noisy data and close subspaces.
Proposes a method to cluster network nodes using multiple layers of network information and node features.
problem Clustering network nodes considering both network information and node features.
method Two-step algorithm: 1) Aggregates network layers into a graph representation, 2) Uses neural net to learn a feature embedding.
result Significant improvement in multilayer graph clustering compared to state-of-the-art methods.
Paper perfect clusters sparse, diverse multilayer networks.
problem Clustering sparse, diverse multilayer networks.
method Tensor-based methodology pooling all layers' information.
result Achieves perfect clustering under sparser conditions than previous models.
ALMA improves clustering of multilayer networks.
problem Clustering multilayer networks with distinct layers and communities.
method Alternating minimization algorithm (ALMA) for simultaneous layer partition and community estimation.
result ALMA achieves higher accuracy than TWIST in clustering multilayer networks.
Develops rMultiNet R package for multilayer network analysis.
problem Analyzing multilayer network data.
method Two frameworks: MMSBM and MMLSM for generating multilayer networks; methods for node and layer embedding; clustering.
result Provides tools for multilayer network analysis.
Proposes a new regularizer for semi-supervised learning on multilayer graphs.
problem Semi-supervised learning on multilayer graphs with labeled and unlabeled data.
method Generalized matrix mean regularizer and matrix-free numerical scheme.
result The regularizer outperforms state-of-the-art methods numerically.
Unsupervised neural network learns graph embeddings for various tasks.
problem Efficiently representing and comparing families of graphs for mining tasks.
method An unsupervised neural network approach to learn graph embeddings.
result Our method outperforms graph distances and kernels in clustering and classification tasks.
A new method clusters data from multiple sources using a mixture of multilayer SBMs.
problem Aggregating multiple clustering results from different data sources.
method Uses a mixture of multilayer Stochastic Block Models (SBM) to group co-membership matrices.
result Identifies and clusters observations based on their specificities within components.
Improved graph-based multiclass classification for multilayer data.
problem Efficient classification of multilayer data with limited labeled examples.
method Generalized diffuse interface methods applied to multilayer graphs, using spectral decomposition and fast matrix-vector products.
result Highly scalable and efficient classification for large, high-dimensional data sets.
Multilayer bootstrap network builds a gradually narrowed multilayer nonlinear network from bottom up for unsupervised nonlinear dimensionality reduction. Each layer of the network is a nonparametric density estimator. It consists of a group of k-centroids clusterings. Each clustering randomly selects data points with r…
A novel multilayer network approach for text analysis.
problem Clustering documents and finding topics in large collections with metadata and hyperlinks.
method Multilayer Networks and Stochastic Block Models applied to multiple data types.
result Taking into account multiple types of information improves topic and document clustering.
Relationships between entities in datasets are often of multiple nature, like geographical distance, social relationships, or common interests among people in a social network, for example. This information can naturally be modeled by a set of weighted and undirected graphs that form a global multilayer graph, where th…
Multilayer networks are a useful data structure for simultaneously capturing multiple types of relationships between a set of nodes. In such networks, each relational definition gives rise to a layer. While each layer provides its own set of information, community structure across layers can be collectively utilized to…
Paper uses SSC for identifying layers with identical community structures in DIMPLE networks.
problem Identifying layers with identical community structures in DIMPLE networks.
method Sparse Subspace Clustering (SSC) for identifying groups of layers with identical community structures.
result SSC leads to strongly consistent between-layer clustering under mild conditions.
SDP approach recovers communities in multilayer hypergraphs from aggregated similarity matrices.
problem Community recovery in multilayer hypergraphs using aggregated similarity matrices.
method Semidefinite programming (SDP) approach.
result Information-theoretic conditions for exact recovery in both assortative and disassortative cases.
Novel model detects communities in noisy multilayer networks.
problem Understanding communities in noisy multilayer networks.
method Hierarchical variational inference for joint detection and typologizing.
result Discover communities of subjects with co-occurrent psychopathologies.
Model visualizes and analyzes multilayer networks in a latent space.
problem Characterize multiple social networks over a common set of actors.
method Bayesian statistical model with hierarchical prior distribution.
result Visualizes multilayer network data in a low-dimensional Euclidean space.
PCGs encompass a broader range of neural networks.
problem Understanding the broader scope of neural network models.
method Proving PCGs as a superset of feedforward neural networks.
result PCGs represent a wider class of neural network models.
A method for community detection in multilayer networks using data matrices.
problem Community detection in multilayer networks with various node attributes.
method Data matrix representation and regular decomposition method extension for compression.
result Method identifies community structures well-aligned with real-world network hierarchies.
Proposes graph neural network layers for manifold-valued graphs.
problem Graphs with features in a Riemannian manifold.
method Diffusion layer and tangent multilayer perceptron.
result Outperforms state-of-the-art networks on Alzheimer's classification.
Paper forecasts dynamic transportation networks using probabilistic models.
problem Forecasting temporal evolution of transportation networks.
method Probabilistic latent network model with Bayesian inference.
result Models accurately predict future network states and community structures.
Proposes a multilayer nonlinear semi-nonnegative matrix factorization for better recommendation.
problem Inaccurate user-item interaction modeling with classical matrix factorization.
method Multilayer nonlinear Semi-NMF approach for latent user and item representations.
result Proposed method achieves better generalization in prediction and comparable representation in clustering.
Proposes a new deep topic model using MBN and Lasso.
problem Difficult optimization problem in topic modeling.
method Multilayer bootstrap network (MBN) for dimension reduction, supervised Lasso for topic word discovery.
result Effectiveness demonstrated on 20-newsgroups and TDT2 corpora.
Model predicts loan default risk using dynamic multilayer graph neural networks.
problem Credit risk assessment through borrower connections.
method Dynamic multilayer graph neural network with attention mechanism.
result Attention mechanism improves model performance.
New method constructs equivariant neural networks for arbitrary matrix groups.
problem Challenges in constructing equivariant neural networks for complex groups.
method Completely general algorithm for solving equivariant layers of matrix groups.
result Constructs multilayer perceptrons equivariant to multiple groups including O(1,3), O(5), Sp(n), and Rubik's cube group.
Graph clustering uses multiscale community detection for improved performance.
problem Improving data clustering accuracy and robustness.
method Graph-theoretical approach combining multiscale community detection.
result Multiscale graph-based clustering achieves better performance than traditional methods.
Graph pooling method uses GNN to cluster graphs efficiently.
problem Efficiently cluster graphs for graph pooling.
method Formulates a continuous relaxation of minCUT, trains GNN to minimize it.
result GNN-based clustering learns fast and performs well.
A new model for graph clustering using curvature spaces.
problem Graph clustering from a geometric perspective.
method Introducing a heterogeneous curvature space and a contrastive learning approach.
result CONGREGATE model outperforms state-of-the-art competitors.
Proposes methods for local clustering in attributed graphs.
problem Finding a single cluster concentrated on a specific region in a graph.
method Introduces Graph Unimodality (GU) and Attribute Unimodality (AU) measures, and LOCLU algorithm to optimize Compactness score.
result Local cluster detected by LOCLU concentrates on the region of interest and exhibits unimodal data distribution.
This paper analyzes various graph clustering methods and their applications.
problem Dividing graphs into homogeneous groups for diverse applications.
method Traditional and deep learning-based clustering methods are compared.
result Deep learning techniques improve clustering accuracy.
Adaptive graph auto-encoder improves general data clustering.
problem Extending graph convolution networks to general clustering tasks.
method Adaptive graph construction based on generative perspective, novel decoder design.
result Model performs well in weighted graph scenarios.
Joint learning framework for clustering and graph construction.
problem Graph construction not fitting clustering requirements.
method Joint learning framework to learn graph and clustering simultaneously.
result Improved clustering accuracy on 10 datasets.
AMOS automates model order selection for spectral graph clustering.
problem Automated selection of the correct number of clusters in spectral graph clustering.
method Incrementally increases the number of clusters, estimates cluster quality, and provides reliability tests.
result AMOS outputs clusters of minimal model order with statistical guarantees.
Proposes a method to preserve graph similarities for better clustering accuracy.
problem Sub-optimal performance due to non-similarity-preserving kernels in graph-based clustering.
method Adaptive graph learning method that preserves pairwise similarities and unifies clustering and graph learning.
result Improves clustering accuracy by preserving pairwise similarities in the graph.
Graph clustering remains challenging for GNNs, but a new method improves performance.
problem Graph clustering is difficult for GNNs, especially in noisy data.
method Developed Deep Modularity Networks (DMoN) inspired by modularity measure.
result DMoN produces high-quality clusters with over 40% improvement over other methods.
A novel multi-view spectral clustering model fuses and clusters data views.
problem Fusing and clustering multi-view data effectively.
method Simultaneously fuses and clusters views into a single graph.
result The proposed method outperforms existing techniques.
This paper proposes an organized generalization of Newman and Girvan's modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure produces topologically ordered graph clusterings that lead to faithful and readable graph representations based on clustering induced graphs. Topog…
Adaptive graph convolution improves attributed graph clustering performance.
problem Joint modeling of graph structures and node attributes is challenging.
method Adaptive graph convolution that captures global cluster structure and selects appropriate order for different graphs.
result Empirical results show our method compares favorably with state-of-the-art methods.
New algorithm speeds up spectral clustering for dynamic graphs.
problem Prohibitive complexity of spectral clustering for dynamic graphs.
method Reuse past cluster assignments and use fast Chebyshev graph filtering.
result Achieves clustering quality approximating spectral clustering with significant complexity benefits.
Network Lasso clusters sparse graph clusters efficiently.
problem Local graph clustering of sparse and chain-like clusters.
method Network Lasso minimizes total variation of cluster indicator signals.
result Network Lasso handles sparse clusters difficult for spectral clustering.
The paper explains how regularization improves spectral clustering by reducing sensitivity to noise.
problem Spectral clustering's sensitivity to noise in sparse and stochastic graphs.
method Using graph conductance and regularization to improve spectral clustering.
result Regularization reduces sensitivity to small cuts in the graph, improving clustering accuracy and speed.
New method clusters directed graphs using Koopman operators.
problem Challenges in clustering directed graphs, especially complex eigenvalues and lack of cluster definition.
method Relate graph Laplacians to transfer operators and metastable sets in stochastic systems, derive clustering algorithms for directed and time-evolving graphs.
result Clusters can be interpreted as coherent sets, useful for analyzing transport and mixing processes.
Enhanced spectral clustering for geometric graphs improves clustering accuracy.
problem Ineffective standard spectral clustering for geometric graphs.
method Higher-order spectral clustering using higher-order eigenvectors.
result Established weak and strong consistency for Soft Geometric Block Model.
ECG outperforms graph clustering algorithms using ensemble method.
problem Graph clustering challenges.
method ECG combines Louvain algorithm and consensus clustering.
result ECG outperforms leading algorithms on artificial networks.