Co-guided Random Walk for Polarized Communities Search-Reference-Cited by-同舟云学术

Co-guided Random Walk for Polarized Communities Search

Published:2023-10-21 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 32nd ACM International Conference on Information and Knowledge Management
language:
Short-container-title:

Author:

Yang Fanyi¹^ORCID,Ma Huifang¹^ORCID,Yan Cairui¹^ORCID,Li Zhixin²^ORCID,Chang Liang³^ORCID

Affiliation:

1. Northwest Normal University, Lanzhou, China

2. Guangxi Normal University, Guilin, China

3. Guilin University of Electronic Technology, Guilin, China

Funder

the Industrial Support Project of Gansu Colleges China

National Natural Science Foundation of China

Guangxi Key Laboratory of Trusted Software

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3583780.3614814

Reference35 articles.

1. You, Me, and IoT: How Internet-connected Consumer Devices Affect Interpersonal Relationships

2. Francesco Bonchi , Edoardo Galimberti , Aristides Gionis , Bruno Ordozgoiti , and Giancarlo Ruffo . 2019 . Discovering Polarized Communities in Signed Networks. In the 28th ACM International Conference on Information and Knowledge Management (CIKM). 961--970 . Francesco Bonchi, Edoardo Galimberti, Aristides Gionis, Bruno Ordozgoiti, and Giancarlo Ruffo. 2019. Discovering Polarized Communities in Signed Networks. In the 28th ACM International Conference on Information and Knowledge Management (CIKM). 961--970.

3. Tyler Derr , Charu C. Aggarwal , and Jiliang Tang . 2018 . Signed Network Modeling Based on Structural Balance Theory. In the 27th ACM International Conference on Information and Knowledge Management (CIKM). 557--566 . Tyler Derr, Charu C. Aggarwal, and Jiliang Tang. 2018. Signed Network Modeling Based on Structural Balance Theory. In the 27th ACM International Conference on Information and Knowledge Management (CIKM). 557--566.

4. Effective community search for large attributed graphs

5. A survey of community search over big graphs