Finding low-tension communities
No Thumbnail Available
Access rights
openAccess
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
2017
Department
Department of Computer Science
Major/Subject
Mcode
Degree programme
Language
en
Pages
9
336-344
336-344
Series
Proceedings of the 17th SIAM International Conference on Data Mining, SDM 2017, Proceedings of the SIAM International Conference on Data Mining
Abstract
Motivated by applications that arise in online social media and collaboration networks, there has been a lot of work on community-search. In this class of problems, the goal is to find a subgraph that satisfies a certain connectivity requirement and contains a given collection of seed nodes. In this paper, we extend the community-search problem by associating each individual with a profile. The profile is a numeric score that quantifies the position of an individual with respect to a topic. We adopt a model where each individual starts with a latent profile and arrives to a conformed profile through a dynamic conformation process, which takes into account the individual's social interaction and the tendency to conform with one's social environment. In this framework, social tension arises from the differences between the conformed profiles of neighboring individuals as well as from the differences between individuals' conformed and latent profiles. Given a network of individuals, their latent profiles and this conformation process, we extend the community- search problem by requiring the output subgraphs to have low social tension. From the technical point of view, we study the complexity of this problem and propose algorithms for solving it effectively. Our experimental evaluation in a number of social networks reveals the efficacy and efficiency of our methods.Description
| openaire: EC/H2020/654024/EU//SoBigData
Keywords
Other note
Citation
Galbrun, E, Golshan, B, Gionis, A & Terzi, E 2017, Finding low-tension communities . in N Chawla & W Wang (eds), Proceedings of the 17th SIAM International Conference on Data Mining, SDM 2017 . Proceedings of the SIAM International Conference on Data Mining, Society for Industrial and Applied Mathematics, pp. 336-344, SIAM International Conference on Data Mining, Houston, United States, 27/04/2017 . https://doi.org/10.1137/1.9781611974973.38