2016
DOI: 10.1002/widm.1178
|View full text |Cite
|
Sign up to set email alerts
|

Community detection in social networks

Abstract: The expansion of the web and emergence of a large number of social networking sites (SNS) have empowered users to easily interconnect on a shared platform. A social network can be represented by a graph consisting of a set of nodes and edges connecting these nodes. The nodes represent the individuals/entities, and the edges correspond to the interactions among them. The tendency of people with similar tastes, choices, and preferences to get associated in a social network leads to the formation of virtual clust… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
102
0
3

Year Published

2017
2017
2022
2022

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 221 publications
(105 citation statements)
references
References 108 publications
0
102
0
3
Order By: Relevance
“…Community detection is the process of discovering communities in networks and is widely used in network analysis (Bedi and Sharma 2016). We use the walktrap algorithm (Pons and Latapy 2005) to detect communities in the university knowledge transfer network.…”
Section: Community Detection Measuresmentioning
confidence: 99%
“…Community detection is the process of discovering communities in networks and is widely used in network analysis (Bedi and Sharma 2016). We use the walktrap algorithm (Pons and Latapy 2005) to detect communities in the university knowledge transfer network.…”
Section: Community Detection Measuresmentioning
confidence: 99%
“…, B k−1 be the clockwise sequence of groups along R(C), starting from an arbitrary group B 0 . For each group B i , let f i and l i be its first and its last element, respectively, i.e., l i and f i+1 (indexes taken (3,4), (4,5). In (a) the chords form 3 crossings, while in (b) they do not cross, due to a more convenient choice of the representative pair of arcs for the edges (1, 2) and (3,4).…”
Section: Algorithmsmentioning
confidence: 99%
“…The algorithm consists of three stages: community detection, merging, and refining. OCMiner is a density‐based community detection algorithm proposed by Bhat et al Further overlapping community detection algorithms were surveyed in details in Ref .…”
Section: Related Workmentioning
confidence: 99%