KCoreMotif clusters large networks efficiently by exploiting k-core decomposition and motifs.
problem Efficiently clustering large networks for trust evaluation.
method Exploits k-core decomposition and motifs to perform motif-based spectral clustering on k-core subgraphs.
result The proposed algorithm is accurate and efficient for large networks.
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.
A fundamental property of complex networks is the tendency for edges to cluster. The extent of the clustering is typically quantified by the clustering coefficient, which is the probability that a length-2 path is closed, i.e., induces a triangle in the network. However, higher-order cliques beyond triangles are crucia…
Paper optimizes clustering for multi-layer networks and discrete mixtures.
problem Optimizing clustering in multi-layer networks and discrete mixtures.
method Two-stage method: tensor-based initialization and likelihood-based refinement.
result Achieves minimax optimal error rate for multi-layer networks and discrete mixtures.
This paper clusters networks with annotated time-series data using kernel-ARMA and Grassmannian geometry.
problem Clustering networks with annotated time-series data, including state, node, and subnetwork clustering.
method Extract features from time-series data using kernel-ARMA, map onto Grassmannian, and cluster using Riemannian geometry.
result The proposed framework outperforms state-of-the-art clustering schemes on brain-network data.
Randomized spectral co-clustering speeds up large-scale directed networks.
problem Co-clustering directed networks efficiently for large-scale data.
method Randomized spectral co-clustering algorithms using random-projection and random-sampling techniques.
result Theoretical and numerical validation of approximation and misclustering error rates.
New spectral clustering method for multi-layer networks improves accuracy.
problem Detecting community structure in multi-layer networks.
method Integrative spectral clustering based on adaptive layer aggregation.
result Our methods minimize mis-clustering error and outperform existing methods.
A new method clusters complex networks using topological and geometric structure.
problem Clustering complex networks with intricate topology.
method Centroid-based clustering strategy using Wasserstein distance and barycenter for persistence barcodes.
result Demonstrated effectiveness on simulated and real-world networks.
MC-GMENN improves neural networks for clustered data using Monte Carlo methods.
problem Improving neural network performance on clustered data with correlations.
method MC-GMENN employs Monte Carlo methods to train generalized mixed effects neural networks.
result MC-GMENN outperforms existing models in generalization and quantifying inter-cluster variance.
This paper considers networks where relationships between nodes are represented by directed dissimilarities. The goal is to study methods that, based on the dissimilarity structure, output hierarchical clusters, i.e., a family of nested partitions indexed by a connectivity parameter. Our construction of hierarchical cl…
Meta-learning neural networks for better clustering representations.
problem Improving clustering performance with appropriate representations.
method Meta-learning method that trains neural networks for representations using VB inference with an infinite Gaussian mixture model.
result The method achieves higher clustering performance than existing methods.
New method clusters weighted directed networks using motifs.
problem Clustering directed networks fails to consider higher-order structure and edge weights.
method Motif-based weighted spectral clustering with new matrix formulae.
result Scalable and effective clustering on large graphs and real-world data.
Community detection, which focuses on clustering nodes or detecting communities in (mostly) a single network, is a problem of considerable practical interest and has received a great deal of attention in the research community. While being able to cluster within a network is important, there are emerging needs to be ab…
Deep learning improves community detection in graph datasets.
problem Community detection in graph datasets using deep learning.
method Proposes a deep learning approach using Gumbel Softmax for clustering graph nodes.
result The new approach significantly outperforms traditional clustering methods.
Deep clustering has increasingly been demonstrating superiority over conventional shallow clustering algorithms. Deep clustering algorithms usually combine representation learning with deep neural networks to achieve this performance, typically optimizing a clustering and non-clustering loss. In such cases, an autoenco…
Proposes a new model for clustering multiplex networks with compositional data.
problem Clustering multiplex networks with multiple types of relations and compositional data.
method Multiplex Dirichlet stochastic block model for compositional networks.
result Validated through simulation and applied to international export data.
This paper considers networks where relationships between nodes are represented by directed dissimilarities. The goal is to study methods for the determination of hierarchical clusters, i.e., a family of nested partitions indexed by a connectivity parameter, induced by the given dissimilarity structures. Our constructi…
NN-EVCLUS uses neural networks to cluster data with uncertainty.
problem Clustering data with uncertainty and handling outliers.
method NN-EVCLUS learns a neural network to map attributes to mass functions, minimizing discrepancy between dissimilarities and conflict.
result NN-EVCLUS outperforms existing methods in clustering tasks.
DIGRAC clusters directed graphs using flow imbalance, outperforming existing methods.
problem Clustering directed networks without label supervision.
method DIGRAC uses a graph neural network with a novel imbalance loss for directed flow imbalance.
result DIGRAC outperforms 10 state-of-the-art methods on directed graph clustering.
Proposes VCLANC for attributed network clustering using node and attribute embeddings.
problem Lack of mutual affinity exploitation between nodes and attributes in graph convolution.
method Dual variational auto-encoders for node and attribute embeddings, Gaussian mixture model priors, mutual distance and clustering assignment hardening losses.
result Demonstrates effectiveness on real-world attributed network datasets.
Develops a new framework to measure network connectedness across and within markets.
problem Lack of flexible methods to measure network connectedness and its evolution.
method Allows network nodes to be connected in clusters, with shocks orthogonal across clusters and correlated within clusters.
result Demonstrates the effectiveness of the new framework in a detailed empirical analysis of equity markets.
Traditional clustering methods often perform clustering with low-level indiscriminative representations and ignore relationships between patterns, resulting in slight achievements in the era of deep learning. To handle this problem, we develop Deep Discriminative Clustering (DDC) that models the clustering task by inve…
Improved spectral clustering for community detection in networks.
problem Community detection in networks.
method Improved spectral clustering (ISC) based on k-means clustering on weighted eigenvectors of a regularized Laplacian matrix.
result ISC yields stable consistent community detection under mild conditions and outperforms classical methods.
DMAE uses neural networks to cluster data with flexible dissimilarity functions.
problem Clustering data with complex dissimilarity functions.
method Integrates a dissimilarity mixture model into deep learning architectures.
result DMAE achieves competitive clustering accuracy compared to other methods.
New method reduces clustering time and improves accuracy.
problem High time and space complexity in spectral clustering.
method Approximate spectral clustering using GNG network topology.
result Equal or better clustering performance than traditional SC.
Model clusters networks and their communities simultaneously.
problem Clustering networks and their communities in unlabeled, heterogeneous networks.
method Nested Stochastic Block Model (NSBM) with Bayesian approach and NDP prior.
result Model accurately estimates both within and across network clustering structures.
New algorithm optimally clusters networks with side information.
problem Improving network clustering with side information.
method Iterative clustering algorithm for Contextual Stochastic Block Model.
result Optimal performance under Contextual Symmetric Stochastic Block Model.
A promising paradigm for achieving highly efficient deep neural networks is the idea of evolutionary deep intelligence, which mimics biological evolution processes to progressively synthesize more efficient networks. A crucial design factor in evolutionary deep intelligence is the genetic encoding scheme used to simula…
We present a novel clustering approach for moving object trajectories that are constrained by an underlying road network. The approach builds a similarity graph based on these trajectories then uses modularity-optimization hiearchical graph clustering to regroup trajectories with similar profiles. Our experimental stud…
Recent advances in neuroscience and in the technology of functional magnetic resonance imaging (fMRI) and electro-encephalography (EEG) have propelled a growing interest in brain-network clustering via time-series analysis. Notwithstanding, most of the brain-network clustering methods revolve around state clustering an…
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.
A new method clusters subjects based on brain networks without vectorizing fMRI data.
problem Distortion of clustering results when simplifying fMRI data structure.
method Wishart mixture models for multiple-view clustering of brain networks.
result Identifies multiple underlying pairs of associations between subject clusters and brain sub-networks.
Networks or graphs can easily represent a diverse set of data sources that are characterized by interacting units or actors. Social networks, representing people who communicate with each other, are one example. Communities or clusters of highly connected actors form an essential feature in the structure of several emp…
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.
Novel GNN method for semi-supervised clustering of signed networks.
problem Lack of effective node embeddings for signed network clustering.
method SSSNET: Probabilistic balanced normalized cut loss for GNN.
result SSSNET achieves comparable or better results than state-of-the-art methods.
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.
A recent trend in machine learning has been to enrich learned models with the ability to explain their own predictions. The emerging field of Explainable AI (XAI) has so far mainly focused on supervised learning, in particular, deep neural network classifiers. In many practical problems however, label information is no…
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.
Unified approach for clustering financial multiplex networks.
problem Lack of methods to capture interconnections between assets over time.
method Tensor-based unified local and global clustering coefficients for multiplex networks.
result Unified clustering coefficients effectively describe dependencies between assets over time.
Deep clustering is the first method to handle general audio separation scenarios with multiple sources of the same type and an arbitrary number of sources, performing impressively in speaker-independent speech separation tasks. However, little is known about its effectiveness in other challenging situations such as mus…
This paper presents a neural network-based end-to-end clustering framework. We design a novel strategy to utilize the contrastive criteria for pushing data-forming clusters directly from raw data, in addition to learning a feature embedding suitable for such clustering. The network is trained with weak labels, specific…
This paper characterizes hierarchical clustering methods that abide by two previously introduced axioms -- thus, denominated admissible methods -- and proposes tractable algorithms for their implementation. We leverage the fact that, for asymmetric networks, every admissible method must be contained between reciprocal …
New spectral clustering method handles discrete covariates for better community detection.
problem Community detection in networks with discrete covariates.
method Spectral algorithm that separates latent network structure from observed covariates.
result Achieves perfect clustering with high probability in large, sparse networks.
A new model clusters network nodes based on relative edge weights.
problem Clustering networks ignores node capacities, leading to biased results.
method Proposes a Dirichlet stochastic block model for composition-weighted networks.
result Validated on simulated and real-world networks, showing improved clustering accuracy.
In this paper we propose a Deep Autoencoder MIxture Clustering (DAMIC) algorithm based on a mixture of deep autoencoders where each cluster is represented by an autoencoder. A clustering network transforms the data into another space and then selects one of the clusters. Next, the autoencoder associated with this clust…
Network data appears in very diverse applications, like biological, social, or sensor networks. Clustering of network nodes into categories or communities has thus become a very common task in machine learning and data mining. Network data comes with some information about the network edges. In some cases, this network…
Proposes methods to recover labels from shuffled networks using graph averages.
problem Recovering labels from a shuffled network using graph averages.
method Cluster networks into classes, then match the new graph to cluster-averages, minimizing the graph matching objective function.
result Higher fidelity matching performance when clustering networks into different classes.
Dual regularized graph Laplacian improves spectral clustering for community detection.
problem Detecting clusters in networks with improved spectral clustering methods.
method Proposes dual regularized graph Laplacian for three spectral clustering approaches.
result Theoretical analysis shows DRSC and DRSLIM yield stable consistent community detection.