A graph-based algorithm for interpersonal ties clustering in signed networks
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 signe...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University North
2019-01-01
|
| Series: | Tehnički Glasnik |
| Subjects: | |
| Online Access: | https://hrcak.srce.hr/file/333668 |
| id |
doaj-54751d2325ba48eeb13b35f2aac6da84 |
|---|---|
| record_format |
Article |
| spelling |
doaj-54751d2325ba48eeb13b35f2aac6da842020-11-25T02:53:07ZengUniversity NorthTehnički Glasnik1846-61681848-55882019-01-01134275279A graph-based algorithm for interpersonal ties clustering in signed networksSumalee Sangamuang0Chiang Mai University, College of Arts, Media and Technology, 239 Huaykaew Rd., Suthep, Muang, Chiang Mai, 50200 ThailandSocial 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.https://hrcak.srce.hr/file/333668graph partitionmin-cutssigned graphssocial networkssocial ties |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Sumalee Sangamuang |
| spellingShingle |
Sumalee Sangamuang A graph-based algorithm for interpersonal ties clustering in signed networks Tehnički Glasnik graph partition min-cuts signed graphs social networks social ties |
| author_facet |
Sumalee Sangamuang |
| author_sort |
Sumalee Sangamuang |
| title |
A graph-based algorithm for interpersonal ties clustering in signed networks |
| title_short |
A graph-based algorithm for interpersonal ties clustering in signed networks |
| title_full |
A graph-based algorithm for interpersonal ties clustering in signed networks |
| title_fullStr |
A graph-based algorithm for interpersonal ties clustering in signed networks |
| title_full_unstemmed |
A graph-based algorithm for interpersonal ties clustering in signed networks |
| title_sort |
graph-based algorithm for interpersonal ties clustering in signed networks |
| publisher |
University North |
| series |
Tehnički Glasnik |
| issn |
1846-6168 1848-5588 |
| publishDate |
2019-01-01 |
| description |
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. |
| topic |
graph partition min-cuts signed graphs social networks social ties |
| url |
https://hrcak.srce.hr/file/333668 |
| work_keys_str_mv |
AT sumaleesangamuang agraphbasedalgorithmforinterpersonaltiesclusteringinsignednetworks AT sumaleesangamuang graphbasedalgorithmforinterpersonaltiesclusteringinsignednetworks |
| _version_ |
1724726653084499968 |