2020
DOI: 10.1007/s10994-020-05882-8
|View full text |Cite
|
Sign up to set email alerts
|

Embedding-based Silhouette community detection

Abstract: Mining complex data in the form of networks is of increasing interest in many scientific disciplines. Network communities correspond to densely connected subnetworks, and often represent key functional parts of real-world systems. This paper proposes the embedding-based Silhouette community detection (SCD), an approach for detecting communities, based on clustering of network node embeddings, i.e. real valued representations of nodes derived from their neighborhoods. We investigate the performance of the propo… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 54 publications
0
5
0
Order By: Relevance
“…The partition is performed while aiming to minimize the in-cluster variance and maximize the variance between the elements from different clusters. To determine the optimal number of clusters [ 77 ], we computed the silhouette scores of k-means clustering runs with k ∈ [3;6]. The silhouette scores of the clustering models were generated on the 2,782,720 tweets of 420,617 unique users between December 30, 2019, and April 30, 2021, related to 141,407 n-grams with n ∈ [2;4].…”
Section: Resultsmentioning
confidence: 99%
“…The partition is performed while aiming to minimize the in-cluster variance and maximize the variance between the elements from different clusters. To determine the optimal number of clusters [ 77 ], we computed the silhouette scores of k-means clustering runs with k ∈ [3;6]. The silhouette scores of the clustering models were generated on the 2,782,720 tweets of 420,617 unique users between December 30, 2019, and April 30, 2021, related to 141,407 n-grams with n ∈ [2;4].…”
Section: Resultsmentioning
confidence: 99%
“…Input: a network G(V, E), the number of nodes in the network n Output: the importance of each node (1) Initialize D � ∅, CC � ∅ (2) for i in n do (3) Calculate D(i) using formula (4) during D decomposition (4) end for (5) for i in n do (6) Calculate CC(i) using formula (5) (7) end for (8) Create matrix R using formula (6) (9) for i in 2 do (10) Calculate E i using formula (7) (11) end for (12) for i in n do (13) Calculate CLC(i) using formula (10) ( 14) end for ALGORITHM 1: Node importance evaluation algorithm.…”
Section: Experimental Results and Analysismentioning
confidence: 99%
“…e community detection technology can predict the hobbies of new network users. In the protein network [3], proteins with the same or similar functions constitute each community. Community detection technology can identify the group of unfamiliar proteins and thus discover the protein function.…”
Section: Introductionmentioning
confidence: 99%
“…SCD (Silhouette Community Detection) [36] is an embedded clustering method, which reveals community structure by optimizing the contour measurement, particularly, extracting the real value representation of nodes from its neighborhood.…”
Section: Methodsmentioning
confidence: 99%