Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Polarized Communities Search via Co-guided Random Walk in Attributed Signed Networks

Published:17 November 2023Publication History
Skip Abstract Section

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.

REFERENCES

  1. [1] Apthorpe Noah J., Naeini Pardis Emami, Mathur Arunesh, Chetty Marshini, and Feamster Nick. 2022. You, me, and IoT: How internet-connected consumer devices affect interpersonal relationships. ACM Trans. Internet Things 3, 4 (2022), 25:1–25:29.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. [2] Bonchi Francesco, Galimberti Edoardo, Gionis Aristides, Ordozgoiti Bruno, and Ruffo Giancarlo. 2019. Discovering polarized communities in signed networks. In The 28th ACM International Conference on Information and Knowledge Management (CIKM). 961970.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. [3] Cartwright Dorwin and Harary Frank. 1956. Structural balance: A generalization of Heider’s theory. Psychological Review 63, 5 (1956), 277.Google ScholarGoogle ScholarCross RefCross Ref
  4. [4] Chang Yang, Ma Huifang, Chang Liang, and Li Zhixin. 2022. Community detection with attributed random walk via seed replacement. Frontiers of Computer Science 16, 5 (2022), 112.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. [5] Chu Lingyang, Wang Zhefeng, Pei Jian, Wang Jiannan, Zhao Zijin, and Chen Enhong. 2016. Finding gangs in war from signed networks. In Proceedings of The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 15051514.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. [6] Derr Tyler, Aggarwal Charu C., and Tang Jiliang. 2018. Signed network modeling based on structural balance theory. In The 27th ACM International Conference on Information and Knowledge Management (CIKM). 557566.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. [7] Fang Yixiang, Cheng Reynold, Luo Siqiang, and Hu Jiafeng. 2016. Effective community search for large attributed graphs. Proc. VLDB Endow. 9, 12 (2016), 12331244.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. [8] Fang Yixiang, Huang Xin, Qin Lu, Zhang Ying, Zhang Wenjie, Cheng Reynold, and Lin Xuemin. 2020. A survey of community search over big graphs. VLDB J. 29, 1 (2020), 353392.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. [9] Gautier Antoine, Tudisco Francesco, and Hein Matthias. 2019. The Perron-Frobenius theorem for multihomogeneous mappings. SIAM J. Matrix Anal. Appl. 40, 3 (2019), 11791205.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. [10] He Chaobo, Zheng Yulong, Cheng Junwei, Tang Yong, Chen Guohua, and Liu Hai. 2022. Semi-supervised overlapping community detection in attributed graph with graph convolutional autoencoder. Inf. Sci. 608 (2022), 14641479.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. [11] He Yixuan, Reinert Gesine, Wang Songchao, and Cucuringu Mihai. 2022. SSSNET: Semi-supervised signed network clustering. In The 2022 SIAM International Conference on Data Mining (SDM). 244252.Google ScholarGoogle ScholarCross RefCross Ref
  12. [12] Huang Xin and Lakshmanan Laks V. S.. 2017. Attribute-driven community search. Proc. VLDB Endow. 10, 9 (2017), 949960.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. [13] Huang Zexi, Silva Arlei, and Singh Ambuj K.. 2022. POLE: Polarized embedding for signed networks. In The Fifteenth ACM International Conference on Web Search and Data Mining (WSDM). 390400.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. [14] Islam Md. Saiful, Ali Mohammed Eunus, Kang Yong-Bin, Sellis Timos, Choudhury Farhana Murtaza, and Roy Shamik. 2022. Keyword aware influential community search in large attributed graphs. Inf. Syst. 104 (2022), 101914.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. [15] Javari Amin, Derr Tyler, Esmailian Pouya, Tang Jiliang, and Chang Kevin Chen-Chuan. 2020. ROSE: Role-based signed network embedding. In The Web Conference 2020 (WWW). 27822788.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. [16] Jung Jinhong, Jin Woojeong, and Kang U.. 2020. Random walk-based ranking in signed social networks: Model and algorithms. Knowl. Inf. Syst. 62, 2 (2020), 571610.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. [17] Kang Yoonsuk, Lee Woncheol, Lee Yeon-Chang, Han Kyungsik, and Kim Sang-Wook. 2021. Adversarial learning of balanced triangles for accurate community detection on signed networks. In The IEEE International Conference on Data Mining, (ICDM). 11501155.Google ScholarGoogle ScholarCross RefCross Ref
  18. [18] Lee Wonchang, Lee Yeon-Chang, Lee Dongwon, and Kim Sang-Wook. [n. d.]. Look before you leap: Confirming edge signs in random walk with restart for personalized node ranking in signed networks. In The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, pages = 143–152, publisher = ACM, year = 2021.Google ScholarGoogle Scholar
  19. [19] Li Bo and Liao Bo. 2017. Protein complexes prediction method based on core-attachment structure and functional annotations. International Journal of Molecular Sciences 18, 9 (2017), 1910.Google ScholarGoogle ScholarCross RefCross Ref
  20. [20] Li Jianian, Bao Peng, Shen Huawei, and Li Xuanya. 2022. MiSTR: A multiview structural-temporal learning framework for rumor detection. IEEE Trans. Big Data 8, 4 (2022), 10071019.Google ScholarGoogle ScholarCross RefCross Ref
  21. [21] Li Ju, Ma Huifang, Li Qingqing, Li Zhixin, and Chang Liang. 2021. A two-stage community search method based on seed replacement and joint random walk. In International Joint Conference on Neural Networks (IJCNN). IEEE, 17.Google ScholarGoogle ScholarCross RefCross Ref
  22. [22] Li Qingqing, Ma Huifang, Li Ju, and Li Zhixin. 2021. Multi-community search using similarity enhanced random walk in attributed networks. Acta Electronica Sinica 49, 11 (2021), 20962100.Google ScholarGoogle Scholar
  23. [23] Li Qingqing, Ma Huifang, Li Ju, Li Zhixin, and Chang Liang. 2023. Attributed multi-query community search via random walk similarity. Inf. Sci. 631 (2023), 91107.Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. [24] Li Qingqing, Ma Huifang, Li Ju, Li Zhixin, and Jiang Yanbin. 2022. Searching target communities with outliers in attributed graph. Knowl. Based Syst. 235 (2022), 107622.Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. [25] Li Qingqing, Ma Huifang, Li Zhixin, and Chang Liang. 2022. Local spectral for multiresolution community search in attributed graph. In The IEEE International Conference on Multimedia and Expo (ICME). 16.Google ScholarGoogle ScholarCross RefCross Ref
  26. [26] Li Yixuan, He Kun, Kloster Kyle, Bindel David, and Hopcroft John E.. 2018. Local spectral clustering for overlapping community detection. ACM Trans. Knowl. Discov. Data 12, 2 (2018), 17:1–17:27.Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. [27] Liu Boge, Zhang Fan, Zhang Wenjie, Lin Xuemin, and Zhang Ying. 2021. Efficient community search with size constraint. In The 37th IEEE International Conference on Data Engineering (ICDE). 97108.Google ScholarGoogle ScholarCross RefCross Ref
  28. [28] Liu Qing, Zhu Yifan, Zhao Minjun, Huang Xin, Xu Jianliang, and Gao Yunjun. 2020. VAC: Vertex-centric attributed community search. In The 36th IEEE International Conference on Data Engineering (ICDE). 937948.Google ScholarGoogle ScholarCross RefCross Ref
  29. [29] Ordozgoiti Bruno, Matakos Antonis, and Gionis Aristides. 2020. Finding large balanced subgraphs in signed networks. In The Web Conference 2020 (WWW). 13781388.Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. [30] Sun Heli, Huang Ruodan, Jia Xiaolin, He Liang, Sun Miaomiao, Wang Pei, Sun Zhongbin, and Huang Jianbin. 2020. Community search for multiple nodes on attribute graphs. Knowl. Based Syst. 193 (2020), 105393.Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. [31] Sun Mengzhu, Zhang Xi, Zheng Jiaqi, and Ma Guixiang. 2022. DDGCN: Dual dynamic graph convolutional networks for rumor detection on social media. In The Thirty-sixth AAAI Conference on Artificial Intelligence (AAAI). 46114619.Google ScholarGoogle ScholarCross RefCross Ref
  32. [32] Sun Renjie, Chen Chen, Wang Xiaoyang, Zhang Ying, and Wang Xun. 2022. Stable community detection in signed social networks. IEEE Trans. Knowl. Data Eng. 34, 10 (2022), 50515055.Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. [33] Sun Renjie, Zhu Qiuyu, Chen Chen, Wang Xiaoyang, Zhang Ying, and Wang Xun. 2020. Discovering cliques in signed networks based on balance theory. In Database Systems for Advanced Applications (DASFAA), Vol. 12113. 666674.Google ScholarGoogle Scholar
  34. [34] Tzeng Ruo-Chun, Ordozgoiti Bruno, and Gionis Aristides. 2020. Discovering conflicting groups in signed networks. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems (NeurIPS).Google ScholarGoogle Scholar
  35. [35] Vinayagam Arunachalam, Zirin Jonathan, Roesel Charles, Hu Yanhui, Yilmazel Bahar, Samsonova Anastasia A., Neumüller Ralph A., Mohr Stephanie E., and Perrimon Norbert. 2014. Integrating protein-protein interaction networks with phenotypes reveals signs of interactions. Nature Methods 11, 1 (2014), 9499.Google ScholarGoogle ScholarCross RefCross Ref
  36. [36] Wang Suhang, Aggarwal Charu C., Tang Jiliang, and Liu Huan. 2017. Attributed signed network embedding. In The 2017 ACM on Conference on Information and Knowledge Management (CIKM). 137146.Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. [37] Xiao Han, Ordozgoiti Bruno, and Gionis Aristides. 2020. Searching for polarization in signed graphs: A local spectral approach. In The Web Conference 2020 (WWW). 362372.Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. [38] Xie Xiaoqin, Song Mingjie, Liu Chiming, Zhang Jiaming, and Li Jiahui. 2021. Effective influential community search on attributed graph. Neurocomputing 444 (2021), 111125.Google ScholarGoogle ScholarCross RefCross Ref
  39. [39] Xie Xiaoqin, Zhang Jiaming, Wang Wei, and Yang Wu. 2022. Attributed community search considering community focusing and latent relationship. Knowl. Inf. Syst. 64, 3 (2022), 799829.Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. [40] Yang Fang, Fan Kunjie, Song Dandan, and Lin Huakang. 2020. Graph-based prediction of protein-protein interactions with attributed signed graph embedding. BMC Bioinformatics 21, 1 (2020), 116.Google ScholarGoogle ScholarCross RefCross Ref
  41. [41] Zhan Youlin, Liu Jiahan, Wu Min, Tan Chris Soon Heng, Li Xiaoli, and Ou-Yang Le. 2023. A partially shared joint clustering framework for detecting protein complexes from multiple state-specific signed interaction networks. bioRxiv (2023), 2023–01.Google ScholarGoogle Scholar
  42. [42] Zhang Yuting, Wang Kai, Zhang Wenjie, Lin Xuemin, and Zhang Ying. 2021. Pareto-optimal community search on large bipartite graphs. In The 30th ACM International Conference on Information and Knowledge Management (CIKM). 26472656.Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. [43] Zhao Jun, Sun Renjie, Zhu Qiuyu, Wang Xiaoyang, and Chen Chen. 2020. Community identification in signed networks: A K-truss based model. In The 29th ACM International Conference on Information and Knowledge Management (CIKM). 23212324.Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. [44] Zhao Qiqi, Ma Huifang, Guo Lijun, and Li Zhixin. 2022. Hierarchical attention network for attributed community detection of joint representation. Neural Comput. Appl. 34, 7 (2022), 55875601.Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. [45] Zhong Zhaoyue, Wang Xiangrong, Qu Cunquan, and Wang Guanghui. 2022. Efficient algorithm based on non-backtracking matrix for community detection in signed networks. IEEE Trans. Netw. Sci. Eng. 9, 4 (2022), 22002211.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Polarized Communities Search via Co-guided Random Walk in Attributed Signed Networks

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM Transactions on Internet Technology
        ACM Transactions on Internet Technology  Volume 23, Issue 4
        November 2023
        249 pages
        ISSN:1533-5399
        EISSN:1557-6051
        DOI:10.1145/3633308
        • Editor:
        • Ling Liu
        Issue’s Table of Contents

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 17 November 2023
        • Online AM: 7 October 2023
        • Accepted: 23 July 2023
        • Revised: 26 May 2023
        • Received: 29 October 2022
        Published in toit Volume 23, Issue 4

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
      • Article Metrics

        • Downloads (Last 12 months)183
        • Downloads (Last 6 weeks)6

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Full Text

      View this article in Full Text.

      View Full Text