Cargando…
Clustering via hypergraph modularity
Despite the fact that many important problems (including clustering) can be described using hypergraphs, theoretical foundations as well as practical algorithms using hypergraphs are not well developed yet. In this paper, we propose a hypergraph modularity function that generalizes its well establis...
Autores principales: | Kamiński, Bogumił, Poulin, Valérie, Prałat, Paweł, Szufel, Przemysław, Théberge, François |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6834335/ https://www.ncbi.nlm.nih.gov/pubmed/31693701 http://dx.doi.org/10.1371/journal.pone.0224307 |
Ejemplares similares
-
Social Influence Maximization in Hypergraphs †
por: Antelmi, Alessia, et al.
Publicado: (2021) -
A framework for sensitivity analysis of decision trees
por: Kamiński, Bogumił, et al.
Publicado: (2017) -
Julia 1.0 programming cookbook: over 100 numerical and distributed computing recipes for your daily data science workflow
por: Kamiński, Bogumił, et al.
Publicado: (2018) -
Model-based clustering for random hypergraphs
por: Ng, Tin Lok James, et al.
Publicado: (2021) -
A study of cluster hypergraphs and its properties
por: Maity, Ananta, et al.
Publicado: (2021)