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

Sumalee Sangamuang

doi:10.31803/tg-20191104192845

Abstract

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.

Highlights

The social internet of things (SIoT) has been proposed and is the subject of a rapidly increasing research effort [1], [2] and [3]
The experimental results show the performances of the proposed algorithm and MINOS solver by measuring the execution times and the accuracy to the partition
The proposed algorithm can perform faster when compared with the MINOS solver, while the accuracy is still acceptable for the vertices ranking on social networks

Summary

INTRODUCTION

The social internet of things (SIoT) has been proposed and is the subject of a rapidly increasing research effort [1], [2] and [3]. In this figure, trust is represented by a straight line, while distrust is represented by a dotted line. This paper considers an optimization problem to find approximately the same cluster size that the sum of the weight of the negative external-edge’s is minimized while the sum of the positive external-edges is less than the given constant. A graph-based algorithm for interpersonal ties clustering in signed networks is proposed to solve the aforementioned problem. Sumalee SANGAMUANG: A GRAPH-BASED ALGORITHM FOR INTERPERSONAL TIES CLUSTERING IN SIGNED NETWORKS

PROBLEM DEFINITION INTRODUCTION

THE ALGORITHM

EXPERIMENT EVALUATION

CONCLUSIONS