Skip to main content
SpringerLink
Log in

(p, n)-core: Core Decomposition in Signed Networks

  • Conference paper
  • First Online:
Database Systems for Advanced Applications (DASFAA 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13245))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Coreness of node v is q if node v belongs to the q-core but not to \((q+1)\)-core.

References

  1. Fang, Y., et al.: A survey of community search over big graphs. VLDBJ 29(1), 353–392 (2020)

    Google Scholar 

  2. 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)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. Kumar, S., Spezzano, F., Subrahmanian, V., Faloutsos, C.: Edge weight prediction in weighted signed networks. In: ICDM, pp. 221–230. IEEE (2016)

    Google Scholar 

  5. Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: SIGCHI, pp. 1361–1370 (2010)

    Google Scholar 

  6. Li, R.H., et al.: Efficient signed clique search in signed networks. In: ICDE, pp. 245–256. IEEE (2018)

    Google Scholar 

  7. 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)

    Article  Google Scholar 

  8. Maniu, S., Abdessalem, T., Cautis, B.: Casting a web of trust over Wikipedia: an interaction-based approach. In: WWW, pp. 87–88 (2011)

    Google Scholar 

  9. 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)

    Google Scholar 

  10. Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269–287 (1983)

    Article  MathSciNet  Google Scholar 

  11. 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)

    Google Scholar 

Download references

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

  1. Nanyang Technological University, Singapore, 639798, Singapore

    Junghoon Kim

  2. Chungnam National University, Daejeon, 34134, South Korea

    Sungsu Lim

Authors
  1. Junghoon Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sungsu Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sungsu Lim .

Editor information

Editors and Affiliations

  1. Indian Institute of Technology Kanpur, Kanpur, India

    Arnab Bhattacharya

  2. National University of Singapore, Singapore, Singapore

    Janice Lee Mong Li

  3. University of California, Santa Barbara, Santa Barbara, CA, USA

    Divyakant Agrawal

  4. IIIT Hyderabad, Hyderabad, India

    P. Krishna Reddy

  5. Indraprastha Institute of Information Technology Delhi, New Delhi, India

    Mukesh Mohania

  6. Ashoka University, Sonepat, Haryana, India

    Anirban Mondal

  7. Indraprastha Institute of Information Technology Delhi, New Delhi, India

    Vikram Goyal

  8. University of Aizu, Aizu, Japan

    Rage Uday Kiran

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics

Search

Navigation