hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.31803/tg-20191104192845

A graph-based algorithm for interpersonal ties clustering in signed networks

Sumalee Sangamuang   ORCID icon orcid.org/0000-0003-0757-0607 ; Chiang Mai University, College of Arts, Media and Technology, 239 Huaykaew Rd., Suthep, Muang, Chiang Mai, 50200 Thailand

Puni tekst: engleski, pdf (1 MB) str. 275-279 preuzimanja: 210* citiraj
APA 6th Edition
Sangamuang, S. (2019). A graph-based algorithm for interpersonal ties clustering in signed networks. Tehnički glasnik, 13 (4), 275-279. https://doi.org/10.31803/tg-20191104192845
MLA 8th Edition
Sangamuang, Sumalee. "A graph-based algorithm for interpersonal ties clustering in signed networks." Tehnički glasnik, vol. 13, br. 4, 2019, str. 275-279. https://doi.org/10.31803/tg-20191104192845. Citirano 19.06.2021.
Chicago 17th Edition
Sangamuang, Sumalee. "A graph-based algorithm for interpersonal ties clustering in signed networks." Tehnički glasnik 13, br. 4 (2019): 275-279. https://doi.org/10.31803/tg-20191104192845
Harvard
Sangamuang, S. (2019). 'A graph-based algorithm for interpersonal ties clustering in signed networks', Tehnički glasnik, 13(4), str. 275-279. https://doi.org/10.31803/tg-20191104192845
Vancouver
Sangamuang S. A graph-based algorithm for interpersonal ties clustering in signed networks. Tehnički glasnik [Internet]. 2019 [pristupljeno 19.06.2021.];13(4):275-279. https://doi.org/10.31803/tg-20191104192845
IEEE
S. Sangamuang, "A graph-based algorithm for interpersonal ties clustering in signed networks", Tehnički glasnik, vol.13, br. 4, str. 275-279, 2019. [Online]. https://doi.org/10.31803/tg-20191104192845

Sažetak
Social ties are formed as a result of interactions and individual preferences of the people in a social network. There are two opposite types which are interpreted as friendship vs. enmity or trust vs. distrust between people. The aforementioned social network structure can be represented by a signed graph, where people are the graph’s vertices and their interactions are graph’s edges. The edges can be positive and negative signs. To determine trustworthiness, this paper considers the problem of a signed graph partitioning with minimizing the sum of the negative edge's weight and balanced size of its clusters. An efficient algorithm to solve such a problem is proposed. The experimental results show that the proposed algorithm outperforms in terms of the execution times and the accuracy within the given bounds.

Ključne riječi
graph partition; min-cuts; signed graphs; social networks; social ties

Hrčak ID: 229494

URI
https://hrcak.srce.hr/229494

Posjeta: 409 *