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...
Saved in:
Main Authors: | Xiaofeng Zhao, Wei Zhao, Mingao Yuan |
---|---|
Format: | article |
Language: | EN |
Published: |
MDPI AG
2021
|
Subjects: | |
Online Access: | https://doaj.org/article/5784e698c94c4263b71c7c06a7aa7e56 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Ideal based hypergraph of a commutative ring
by: V. C. Amritha, et al.
Published: (2021) -
<i>k</i>-Zero-Divisor and Ideal-Based <i>k</i>-Zero-Divisor Hypergraphs of Some Commutative Rings
by: Pinkaew Siriwong, et al.
Published: (2021) -
Another Antimagic Conjecture
by: Rinovia Simanjuntak, et al.
Published: (2021) -
Skolem Number of Cycles and Grid Graphs
by: Braxton Carrigan, et al.
Published: (2021) -
A New Edge Betweenness Measure Using a Game Theoretical Approach: An Application to Hierarchical Community Detection
by: Daniel Gómez, et al.
Published: (2021)