{"title":"Polarized Communities Search via Co-guided Random Walk in Attributed Signed Networks","authors":"Fanyi Yang, Huifang Ma, Cairui Yan, Zhixin Li, Liang Chang","doi":"10.1145/3613449","DOIUrl":null,"url":null,"abstract":"Polarized communities search aims at locating query-dependent communities, in which mostly nodes within each community form intensive positive connections, while mostly nodes across two communities are connected by negative links. Current approaches towards polarized communities search typically model the network topology, while the key factor of node, i.e., the attributes, are largely ignored. Existing studies have shown that community formation is strongly influenced by node attributes and the formation of communities are determined by both network topology and node attributes simultaneously. However, it is nontrivial to incorporate node attributes for polarized communities search. Firstly, it is hard to handle the heterogeneous information from node attributes. Secondly, it is difficult to model the complex relations between network topology and node attributes in identifying polarized communities. To address the above challenges, we propose a novel method Co-guided Random Walk in Attributed signed networks (CoRWA) for polarized communities search by equipping with reasonable attribute setting. For the first challenge, we devise an attribute-based signed network to model the auxiliary relation between nodes and a weight assignment mechanism is designed to measure the reliability of the edges in the signed network. As to the second challenge, a co-guided random walk scheme in two signed networks is designed to explicitly model the relations between topology-based signed network and attribute-based signed network so as to enhance the search result of each other. Finally, we can identify polarized communities by a well-designed Rayleigh quotient in the signed network. Extensive experiments on three real-world datasets demonstrate the effectiveness of the proposed CoRWA. Further analysis reveals the significance of node attributes for polarized communities search.","PeriodicalId":50911,"journal":{"name":"ACM Transactions on Internet Technology","volume":"90 1","pages":"0"},"PeriodicalIF":3.9000,"publicationDate":"2023-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Internet Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3613449","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Polarized communities search aims at locating query-dependent communities, in which mostly nodes within each community form intensive positive connections, while mostly nodes across two communities are connected by negative links. Current approaches towards polarized communities search typically model the network topology, while the key factor of node, i.e., the attributes, are largely ignored. Existing studies have shown that community formation is strongly influenced by node attributes and the formation of communities are determined by both network topology and node attributes simultaneously. However, it is nontrivial to incorporate node attributes for polarized communities search. Firstly, it is hard to handle the heterogeneous information from node attributes. Secondly, it is difficult to model the complex relations between network topology and node attributes in identifying polarized communities. To address the above challenges, we propose a novel method Co-guided Random Walk in Attributed signed networks (CoRWA) for polarized communities search by equipping with reasonable attribute setting. For the first challenge, we devise an attribute-based signed network to model the auxiliary relation between nodes and a weight assignment mechanism is designed to measure the reliability of the edges in the signed network. As to the second challenge, a co-guided random walk scheme in two signed networks is designed to explicitly model the relations between topology-based signed network and attribute-based signed network so as to enhance the search result of each other. Finally, we can identify polarized communities by a well-designed Rayleigh quotient in the signed network. Extensive experiments on three real-world datasets demonstrate the effectiveness of the proposed CoRWA. Further analysis reveals the significance of node attributes for polarized communities search.
期刊介绍:
ACM Transactions on Internet Technology (TOIT) brings together many computing disciplines including computer software engineering, computer programming languages, middleware, database management, security, knowledge discovery and data mining, networking and distributed systems, communications, performance and scalability etc. TOIT will cover the results and roles of the individual disciplines and the relationshipsamong them.