Information Limits for Community Detection in Hypergraph with Label Information
In network data mining, community detection refers to the problem of partitioning the nodes of a network into clusters (communities). This is equivalent to identifying the cluster label of each node. A label estimator is said to be an exact recovery of the true labels (communities) if it coincides w...
Guardado en:
Autores principales: | Xiaofeng Zhao, Wei Zhao, Mingao Yuan |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
MDPI AG
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/5784e698c94c4263b71c7c06a7aa7e56 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Ideal based hypergraph of a commutative ring
por: V. C. Amritha, et al.
Publicado: (2021) -
<i>k</i>-Zero-Divisor and Ideal-Based <i>k</i>-Zero-Divisor Hypergraphs of Some Commutative Rings
por: Pinkaew Siriwong, et al.
Publicado: (2021) -
Another Antimagic Conjecture
por: Rinovia Simanjuntak, et al.
Publicado: (2021) -
Skolem Number of Cycles and Grid Graphs
por: Braxton Carrigan, et al.
Publicado: (2021) -
A New Edge Betweenness Measure Using a Game Theoretical Approach: An Application to Hierarchical Community Detection
por: Daniel Gómez, et al.
Publicado: (2021)