2016
DOI: 10.1007/s13278-016-0399-9
|View full text |Cite
|
Sign up to set email alerts
|

A scalable geometric algorithm for community detection from social networks with incremental update

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 30 publications
0
1
0
Order By: Relevance
“…In our case, the network is build out of employee movements The underlying geometry of organizational dynamics... between organizations. Within the field of network science, the development of algorithms and procedures to detect and track down network communities constitutes an expanding field of research; see Fortunato (2010) for a relatively recent review and Surendran et al (2016) in particular for a geometric approach. A network community-hereafter community-is a subset of organizations (nodes in the network) such that the links within nodes in the community are more prevalent than the links to nodes outside of it.…”
Section: Network Community Structurementioning
confidence: 99%
“…In our case, the network is build out of employee movements The underlying geometry of organizational dynamics... between organizations. Within the field of network science, the development of algorithms and procedures to detect and track down network communities constitutes an expanding field of research; see Fortunato (2010) for a relatively recent review and Surendran et al (2016) in particular for a geometric approach. A network community-hereafter community-is a subset of organizations (nodes in the network) such that the links within nodes in the community are more prevalent than the links to nodes outside of it.…”
Section: Network Community Structurementioning
confidence: 99%