Ria Andryani, M.M., M.Kom, Ria Andryani, M.M., M.Kom (2022) A REVIEW ON OVERLAPPING AND NON-OVERLAPPING COMMUNITY DETECTION ALGORITHMS FOR SOCIAL NETWORK ANALYTICS. A REVIEW ON OVERLAPPING AND NON-OVERLAPPING COMMUNITY DETECTION ALGORITHMS FOR SOCIAL NETWORK ANALYTICS.
|
Text
Edi&RiaEC018010001.pdf Download (278kB) | Preview |
Abstract
Community detection is a common problem that exists in the data graph analytics as the social networks analytics. In the context of social networks, community detection is aimed at to find a group or community that has connectedness between individuals (nodes) with high-intensity interaction. In general, types of group on the social networking can be divided into the overlapping and non-overlapping. We provide an overview of some of the algorithms of overlapping and non-overlapping community detections available today to perform an analysis or a breakdown of the data of social networking. The algorithms for overlapping community detection are: (1) local seed selection algorithm; (2) seed set expansion algorithm; (3) speaker listener label propagation algorithm (SPLA) and the algorithms for detection of non-overlapping community are: (4) multithreaded
| Item Type: | Article |
|---|---|
| Subjects: | H Social Sciences > H Social Sciences (General) |
| Divisions: | Faculty of Law, Arts and Social Sciences > School of Social Sciences |
| Depositing User: | Mr Edi Surya Negara |
| Date Deposited: | 14 Jun 2022 05:04 |
| Last Modified: | 14 Jun 2022 05:04 |
| URI: | http://eprints.binadarma.ac.id/id/eprint/10439 |
Actions (login required)
 |
View Item |
