Abstract
Finding cohesive subgraphs is a key and fundamental problem in network science. k-core is a widely used cohesive subgraph model having many applications. In this paper, we study core decomposition in the signed networks named (p, n)-core that combines k-core and signed edges. (p, n)-core preserves internal sufficient positive edges and deficient negative edges simultaneously to get high-quality cohesive subgraphs. We prove that finding exact (p, n)-core is NP-hard. Therefore, we propose two algorithms with pruning techniques. Finally, we demonstrate the superiority of our proposed algorithms using seven real-world networks.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Coreness of node v is q if node v belongs to the q-core but not to \((q+1)\)-core.
References
Fang, Y., et al.: A survey of community search over big graphs. VLDBJ 29(1), 353–392 (2020)
Giatsidis, C., Cautis, B., Maniu, S., Thilikos, D.M., Vazirgiannis, M.: Quantifying trust dynamics in signed graphs, the s-cores approach. In: SDM, pp. 668–676 (2014)
Kim, J., Guo, T., Feng, K., Cong, G., Khan, A., Choudhury, F.M.: Densely connected user community and location cluster search in location-based social networks. In: SIGMOD, pp. 2199–2209 (2020)
Kumar, S., Spezzano, F., Subrahmanian, V., Faloutsos, C.: Edge weight prediction in weighted signed networks. In: ICDM, pp. 221–230. IEEE (2016)
Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: SIGCHI, pp. 1361–1370 (2010)
Li, R.H., et al.: Efficient signed clique search in signed networks. In: ICDE, pp. 245–256. IEEE (2018)
Malliaros, F.D., Giatsidis, C., Papadopoulos, A.N., Vazirgiannis, M.: The core decomposition of networks: theory, algorithms and applications. VLDBJ 29(1), 61–92 (2020)
Maniu, S., Abdessalem, T., Cautis, B.: Casting a web of trust over Wikipedia: an interaction-based approach. In: WWW, pp. 87–88 (2011)
Sariyüce, A.E., Gedik, B., Jacques-Silva, G., Wu, K.L., Çatalyürek, Ü.V.: Streaming algorithms for k-core decomposition. VLDB 6(6), 433–444 (2013)
Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269–287 (1983)
Wu, Y., Sun, R., Chen, C., Wang, X., Zhu, Q.: Maximum signed (k, r)-truss identification in signed networks. In: CIKM, pp. 3337–3340 (2020)
Acknowledgements
This work was supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No. 2020-0-01441, Artificial Intelligence Convergence Research Center (Chungnam National University)) and supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No. 2019R1F1A1063231).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Kim, J., Lim, S. (2022). (p, n)-core: Core Decomposition in Signed Networks. In: Bhattacharya, A., et al. Database Systems for Advanced Applications. DASFAA 2022. Lecture Notes in Computer Science, vol 13245. Springer, Cham. https://doi.org/10.1007/978-3-031-00123-9_42
Download citation
DOI: https://doi.org/10.1007/978-3-031-00123-9_42
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-00122-2
Online ISBN: 978-3-031-00123-9
eBook Packages: Computer ScienceComputer Science (R0)