Model-based clustering of multiple networks with a hierarchical algorithm (Q57414): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Removed claim: author (P16): Item:Q57410 |
Changed claim: summary_simple (P1639): 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... |
||
| (17 intermediate revisions by 4 users not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4388464963 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pseudo-likelihood methods for community detection in large sparse networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A nonparametric view of network models and Newman–Girvan and other modularities / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Directed scale-free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tracking network dynamics: a survey using graph distances / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Model-Based Clustering, Discriminant Analysis, and Density Estimation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: From here to infinity: sparse finite versus Dirichlet process mixtures in model-based clustering / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: What's in a crowd? Analysis of face-to-face behavioral networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Estimating a network from multiple noisy realizations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Monte Carlo strategies in scientific computing. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Limits of dense graph sequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Modeling heterogeneity in random graphs through latent space models: a selective review / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finite mixture models / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Estimation and Prediction for Stochastic Blockstructures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Bayesian Choice / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Spectral clustering and the high-dimensional stochastic blockmodel / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Model-based clustering for populations of networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Statistical analysis of finite mixture distributions / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/sac/Rebafka24 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q131285860 / rank | |||
Normal rank | |||
| Property / summary | |||
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) | |||
| Property / summary: 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) / rank | |||
Normal rank | |||
| Property / summary: 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) / qualifier | |||
| Property / summary_simple | |||
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. (English) | |||
| Property / summary_simple: 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. (English) / rank | |||
Normal rank | |||
| Property / summary_simple: 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. (English) / qualifier | |||
Latest revision as of 16:06, 23 November 2024
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
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
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. (English)
0 references
