Name
Abstract | ||
|---|---|---|
Finding social network communities (groups) is fundamental in understanding the properties of the whole network and better understanding human behavior. Many definitions of such structures have been proposed, and therefore, also a lot of algorithms for finding them. These algorithms differ in many aspects and each of them has additionally a number of parameters that need to be set apriori. The article presents a comparison of the results of using different algorithms for datasets that have a ground truth. Moreover, for nondeterministic algorithms, the variability of their results was also analyzed. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/BESC.2017.8256374 | 2017 International Conference on Behavioral, Economic, Socio-cultural Computing (BESC) |
Keywords | Field | DocType |
social network analysis,groups,communities,ground truth division | Data mining,Algorithm design,Social network,Nondeterministic algorithm,Computer science,A priori and a posteriori,Ground truth | Conference |
ISBN | Citations | PageRank |
978-1-5386-2367-1 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bogdan Gliwa | 1 | 77 | 8.62 |
| Anna Zygmunt | 2 | 95 | 11.91 |
| Bartosz Grabski | 3 | 0 | 0.34 |
| Maria Stojkow | 4 | 0 | 0.34 |
| Dorota Żuchowska-Skiba | 5 | 1 | 1.02 |