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...
| Permalink: | http://skupni.nsk.hr/Record/nsk.NSK01001061200/Details |
|---|---|
| Matična publikacija: |
Tehnički glasnik (Online) 13 (2019), 4 ; str. 275-279 |
| Glavni autor: | Sangamuang, Sumalee (Author) |
| Vrsta građe: | e-članak |
| Jezik: | eng |
| Predmet: | |
| Online pristup: |
https://doi.org/10.31803/tg-20191104192845 Hrčak |
| LEADER | 01981naa a22003494i 4500 | ||
|---|---|---|---|
| 001 | NSK01001061200 | ||
| 003 | HR-ZaNSK | ||
| 005 | 20200527111037.0 | ||
| 006 | m d | ||
| 007 | cr|||||||||||| | ||
| 008 | 200422s2019 ci a |o |0|| ||eng | ||
| 024 | 7 | |2 doi |a 10.31803/tg-20191104192845 | |
| 035 | |a (HR-ZaNSK)001061200 | ||
| 040 | |a HR-ZaNSK |b hrv |c HR-ZaNSK |e ppiak | ||
| 041 | 0 | |a eng |b eng | |
| 042 | |a croatica | ||
| 044 | |a ci |c hr | ||
| 080 | 1 | |a 51 |2 2011 | |
| 080 | 1 | |a 004 |2 2011 | |
| 100 | 1 | |a Sangamuang, Sumalee |4 aut |9 HR-ZaNSK | |
| 245 | 1 | 2 | |a A graph-based algorithm for interpersonal ties clustering in signed networks |h [Elektronička građa] / |c Sumalee Sangamuang. |
| 300 | |b Ilustr. | ||
| 504 | |a Bibliografija: 13 jed. | ||
| 504 | |a Abstract. | ||
| 520 | |a 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. | ||
| 653 | 0 | |a Graf algoritam |a Društvene veze |a Društvene mreže |a Particioniranje grafa | |
| 773 | 0 | |t Tehnički glasnik (Online) |x 1848-5588 |g 13 (2019), 4 ; str. 275-279 |w nsk.(HR-ZaNSK)000810940 | |
| 981 | |b Be2019 |b B03/19 | ||
| 998 | |b tino2005 | ||
| 856 | 4 | 0 | |u https://doi.org/10.31803/tg-20191104192845 |
| 856 | 4 | 0 | |u http://hrcak.srce.hr/229494 |y Hrčak |
| 856 | 4 | 1 | |y Digitalna.nsk.hr |