Cargando…
Model-based clustering for random hypergraphs
A probabilistic model for random hypergraphs is introduced to represent unary, binary and higher order interactions among objects in real-world problems. This model is an extension of the latent class analysis model that introduces two clustering structures for hyperedges and captures variation in t...
Autores principales: | Ng, Tin Lok James, Murphy, Thomas Brendan |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9418112/ https://www.ncbi.nlm.nih.gov/pubmed/36043219 http://dx.doi.org/10.1007/s11634-021-00454-7 |
Ejemplares similares
-
The effect of heterogeneity on hypergraph contagion models
por: Landry, Nicholas W., et al.
Publicado: (2020) -
Clustering via hypergraph modularity
por: Kamiński, Bogumił, et al.
Publicado: (2019) -
Connectivity of Random Geometric Hypergraphs
por: de Kergorlay, Henry-Louis, et al.
Publicado: (2023) -
A study of cluster hypergraphs and its properties
por: Maity, Ananta, et al.
Publicado: (2021) -
Weighted stochastic block model
por: Ng, Tin Lok James, et al.
Publicado: (2021)