2019
DOI: 10.1109/access.2019.2937580
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Community Detection Algorithm Based on Local Similarity of Clustering Coefficient in Social Networks

Abstract: Community structures are integral and independent parts in a network. Community detection plays an important role in social networks for understanding the structure and predicting user behaviors. Many algorithms have been devised for accurate and efficient community detecting, but there are few community detection algorithms using node similarity. In most real-world networks, nodes tend to create tightly knit groups characterized by a relatively high density of ties. The higher the clustering coefficient of a … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 21 publications
(9 citation statements)
references
References 48 publications
0
9
0
Order By: Relevance
“…ASOCCA (Adjacent node Similarity Optimization Combination Connectivity Algorithm) [37] is a combination connectivity algorithm for optimizing the similarity of adjacent nodes to achieve accurate community testing. It uses the local similarity measure based on the clustering coefficient to identify the nearest neighbor of each node.…”
Section: Methodsmentioning
confidence: 99%
“…ASOCCA (Adjacent node Similarity Optimization Combination Connectivity Algorithm) [37] is a combination connectivity algorithm for optimizing the similarity of adjacent nodes to achieve accurate community testing. It uses the local similarity measure based on the clustering coefficient to identify the nearest neighbor of each node.…”
Section: Methodsmentioning
confidence: 99%
“…As shown in Figure 4 , X i and Y i are the standardized cash-to-assets ratio and current-liability ratio, respectively. After comparing the financial situation of the two types in the later period, we can find that the average financial performance of B -class companies is better than that of A -class companies [ 18 , 19 ]. However, the K-means algorithm also has some shortcomings.…”
Section: Methodsmentioning
confidence: 99%
“…Besides, the user needs to inform previously existing communities and the number of topics (subjects) to be considered by the model, which is not always feasible in practice. In [26], the authors proposed a community detection algorithm called "Adjacent node Similarity Optimization Combination Connectivity Algorithm (ASOCCA)", that considers the similarities amongst nodes by measuring the clustering coefficient of each node in the given network. Similar to the previous work, their algorithm is mainly designed to detect non-overlapping communities in an unweighted and undirected network.…”
Section: A Community Identification Methodsmentioning
confidence: 99%