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.
- [1] . 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 ScholarDigital Library
- [2] . 2019. Discovering polarized communities in signed networks. In The 28th ACM International Conference on Information and Knowledge Management (CIKM). 961–970.Google ScholarDigital Library
- [3] . 1956. Structural balance: A generalization of Heider’s theory. Psychological Review 63, 5 (1956), 277.Google ScholarCross Ref
- [4] . 2022. Community detection with attributed random walk via seed replacement. Frontiers of Computer Science 16, 5 (2022), 1–12.Google ScholarDigital Library
- [5] . 2016. Finding gangs in war from signed networks. In Proceedings of The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1505–1514.Google ScholarDigital Library
- [6] . 2018. Signed network modeling based on structural balance theory. In The 27th ACM International Conference on Information and Knowledge Management (CIKM). 557–566.Google ScholarDigital Library
- [7] . 2016. Effective community search for large attributed graphs. Proc. VLDB Endow. 9, 12 (2016), 1233–1244.Google ScholarDigital Library
- [8] . 2020. A survey of community search over big graphs. VLDB J. 29, 1 (2020), 353–392.Google ScholarDigital Library
- [9] . 2019. The Perron-Frobenius theorem for multihomogeneous mappings. SIAM J. Matrix Anal. Appl. 40, 3 (2019), 1179–1205.Google ScholarDigital Library
- [10] . 2022. Semi-supervised overlapping community detection in attributed graph with graph convolutional autoencoder. Inf. Sci. 608 (2022), 1464–1479.Google ScholarDigital Library
- [11] . 2022. SSSNET: Semi-supervised signed network clustering. In The 2022 SIAM International Conference on Data Mining (SDM). 244–252.Google ScholarCross Ref
- [12] . 2017. Attribute-driven community search. Proc. VLDB Endow. 10, 9 (2017), 949–960.Google ScholarDigital Library
- [13] . 2022. POLE: Polarized embedding for signed networks. In The Fifteenth ACM International Conference on Web Search and Data Mining (WSDM). 390–400.Google ScholarDigital Library
- [14] . 2022. Keyword aware influential community search in large attributed graphs. Inf. Syst. 104 (2022), 101914.Google ScholarDigital Library
- [15] . 2020. ROSE: Role-based signed network embedding. In The Web Conference 2020 (WWW). 2782–2788.Google ScholarDigital Library
- [16] . 2020. Random walk-based ranking in signed social networks: Model and algorithms. Knowl. Inf. Syst. 62, 2 (2020), 571–610.Google ScholarDigital Library
- [17] . 2021. Adversarial learning of balanced triangles for accurate community detection on signed networks. In The IEEE International Conference on Data Mining, (ICDM). 1150–1155.Google ScholarCross Ref
- [18] . [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 Scholar
- [19] . 2017. Protein complexes prediction method based on core-attachment structure and functional annotations. International Journal of Molecular Sciences 18, 9 (2017), 1910.Google ScholarCross Ref
- [20] . 2022. MiSTR: A multiview structural-temporal learning framework for rumor detection. IEEE Trans. Big Data 8, 4 (2022), 1007–1019.Google ScholarCross Ref
- [21] . 2021. A two-stage community search method based on seed replacement and joint random walk. In International Joint Conference on Neural Networks (IJCNN). IEEE, 1–7.Google ScholarCross Ref
- [22] . 2021. Multi-community search using similarity enhanced random walk in attributed networks. Acta Electronica Sinica 49, 11 (2021), 2096–2100.Google Scholar
- [23] . 2023. Attributed multi-query community search via random walk similarity. Inf. Sci. 631 (2023), 91–107.Google ScholarDigital Library
- [24] . 2022. Searching target communities with outliers in attributed graph. Knowl. Based Syst. 235 (2022), 107622.Google ScholarDigital Library
- [25] . 2022. Local spectral for multiresolution community search in attributed graph. In The IEEE International Conference on Multimedia and Expo (ICME). 1–6.Google ScholarCross Ref
- [26] . 2018. Local spectral clustering for overlapping community detection. ACM Trans. Knowl. Discov. Data 12, 2 (2018), 17:1–17:27.Google ScholarDigital Library
- [27] . 2021. Efficient community search with size constraint. In The 37th IEEE International Conference on Data Engineering (ICDE). 97–108.Google ScholarCross Ref
- [28] . 2020. VAC: Vertex-centric attributed community search. In The 36th IEEE International Conference on Data Engineering (ICDE). 937–948.Google ScholarCross Ref
- [29] . 2020. Finding large balanced subgraphs in signed networks. In The Web Conference 2020 (WWW). 1378–1388.Google ScholarDigital Library
- [30] . 2020. Community search for multiple nodes on attribute graphs. Knowl. Based Syst. 193 (2020), 105393.Google ScholarDigital Library
- [31] . 2022. DDGCN: Dual dynamic graph convolutional networks for rumor detection on social media. In The Thirty-sixth AAAI Conference on Artificial Intelligence (AAAI). 4611–4619.Google ScholarCross Ref
- [32] . 2022. Stable community detection in signed social networks. IEEE Trans. Knowl. Data Eng. 34, 10 (2022), 5051–5055.Google ScholarDigital Library
- [33] . 2020. Discovering cliques in signed networks based on balance theory. In Database Systems for Advanced Applications (DASFAA), Vol. 12113. 666–674.Google Scholar
- [34] . 2020. Discovering conflicting groups in signed networks. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems (NeurIPS).Google Scholar
- [35] . 2014. Integrating protein-protein interaction networks with phenotypes reveals signs of interactions. Nature Methods 11, 1 (2014), 94–99.Google ScholarCross Ref
- [36] . 2017. Attributed signed network embedding. In The 2017 ACM on Conference on Information and Knowledge Management (CIKM). 137–146.Google ScholarDigital Library
- [37] . 2020. Searching for polarization in signed graphs: A local spectral approach. In The Web Conference 2020 (WWW). 362–372.Google ScholarDigital Library
- [38] . 2021. Effective influential community search on attributed graph. Neurocomputing 444 (2021), 111–125.Google ScholarCross Ref
- [39] . 2022. Attributed community search considering community focusing and latent relationship. Knowl. Inf. Syst. 64, 3 (2022), 799–829.Google ScholarDigital Library
- [40] . 2020. Graph-based prediction of protein-protein interactions with attributed signed graph embedding. BMC Bioinformatics 21, 1 (2020), 1–16.Google ScholarCross Ref
- [41] . 2023. A partially shared joint clustering framework for detecting protein complexes from multiple state-specific signed interaction networks. bioRxiv (2023), 2023–01.Google Scholar
- [42] . 2021. Pareto-optimal community search on large bipartite graphs. In The 30th ACM International Conference on Information and Knowledge Management (CIKM). 2647–2656.Google ScholarDigital Library
- [43] . 2020. Community identification in signed networks: A K-truss based model. In The 29th ACM International Conference on Information and Knowledge Management (CIKM). 2321–2324.Google ScholarDigital Library
- [44] . 2022. Hierarchical attention network for attributed community detection of joint representation. Neural Comput. Appl. 34, 7 (2022), 5587–5601.Google ScholarDigital Library
- [45] . 2022. Efficient algorithm based on non-backtracking matrix for community detection in signed networks. IEEE Trans. Netw. Sci. Eng. 9, 4 (2022), 2200–2211.Google ScholarCross Ref
Index Terms
- Polarized Communities Search via Co-guided Random Walk in Attributed Signed Networks
Recommendations
On Cohesively Polarized Communities in Signed Networks
WWW '23 Companion: Companion Proceedings of the ACM Web Conference 2023Locating and characterizing polarization is one of the most important issues to enable a healthier web ecosystem. Finding groups of nodes that form strongly stable agreements and participate in collective conflicts with other groups is an important ...
Co-guided Random Walk for Polarized Communities Search
CIKM '23: Proceedings of the 32nd ACM International Conference on Information and Knowledge ManagementPolarized Communities Search (PCS) aims to identify query-dependent communities where positive links predominantly connect nodes within each community, while negative links primarily connect nodes across different communities. Existing solutions ...
Local Spectral for Polarized Communities Search in Attributed Signed Network
Database Systems for Advanced ApplicationsAbstractSigned networks are graphs with edge annotations to indicate whether each interaction is friendly (positive edge) or antagonistic (negative edge). Community search on signed network expects to explore the polarized communities (i.e., two ...
Comments