Model-based clustering of multiple networks with a hierarchical algorithm (Q57414)
From MaRDI portal
scientific article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Model-based clustering of multiple networks with a hierarchical algorithm |
scientific article from arXiv |
Statements
4 November 2022
0 references
6 February 2024
0 references
math.ST
0 references
stat.TH
0 references
Model-based clustering of multiple networks with a hierarchical algorithm (English)
0 references
graph clustering
0 references
multiple networks
0 references
stochastic block model
0 references
agglomerative algorithm
0 references
graphon distance
0 references
integrated classification likelihood
0 references
0 references
0 references
0 references
P1636 (Deleted Property)
This paper introduces a hierarchical algorithm for clustering multiple networks, even when these networks vary in size and do not share the same vertices. The method uses a statistical model-based approach, leveraging stochastic block models (SBMs) to group networks with similar topological structures. Clustering is achieved by maximizing the integrated classification likelihood (ICL) criterion, with an automated selection of the optimal number of clusters. A novel technique is presented to address label-switching issues in SBMs by comparing graphons, enabling accurate aggregation of clusters. The method is evaluated on synthetic data and applied to ecological food web networks, demonstrating its efficiency, interpretability, and robustness compared to existing graph clustering approaches. Property P1636 not found, cannot determine the data type to use.
0 references
P1637 (Deleted Property)
This paper explains a way to group networks, like maps of connections between people or animals, based on how their structure is similar. It uses a smart math-based method called stochastic block models (SBMs) to figure out these groups automatically. The process builds a tree-like diagram (dendrogram) to show how the networks are connected and picks the best number of groups without guessing. A special trick compares parts of the networks to make sure the grouping is accurate, even if the networks are labeled differently. This method was tested on fake data and real examples, like food chains in nature, and worked better than older techniques. Property P1637 not found, cannot determine the data type to use.
0 references
This paper introduces a hierarchical algorithm for clustering multiple networks, even when these networks vary in size and do not share the same vertices. The method uses a statistical model-based approach, leveraging stochastic block models (SBMs) to group networks with similar topological structures. Clustering is achieved by maximizing the integrated classification likelihood (ICL) criterion, with an automated selection of the optimal number of clusters. A novel technique is presented to address label-switching issues in SBMs by comparing graphons, enabling accurate aggregation of clusters. The method is evaluated on synthetic data and applied to ecological food web networks, demonstrating its efficiency, interpretability, and robustness compared to existing graph clustering approaches. (English)
0 references
