2022 7th International Conference on Intelligent Computing and Signal Processing (ICSP) 2022
DOI: 10.1109/icsp54964.2022.9778359
|View full text |Cite
|
Sign up to set email alerts
|

A node label overlapping community division algorithm based on entropy conversion

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…Detect communities by means of densely connected subgraphs with homogeneous attribute values. Wang et al [15] proposes an entropy transform (ECDA)-based algorithm for node label overlapping community partitioning. First, a new initialization method is used to initialize the node labels, and a new node similarity calculation method is defined in combination with a certain similarity between direct friends and indirect friends in social networks.…”
Section: Community Discovery Algorithms Considering Overlapping Nodesmentioning
confidence: 99%
“…Detect communities by means of densely connected subgraphs with homogeneous attribute values. Wang et al [15] proposes an entropy transform (ECDA)-based algorithm for node label overlapping community partitioning. First, a new initialization method is used to initialize the node labels, and a new node similarity calculation method is defined in combination with a certain similarity between direct friends and indirect friends in social networks.…”
Section: Community Discovery Algorithms Considering Overlapping Nodesmentioning
confidence: 99%