dc.citation.conferencePlace |
ZZ |
- |
dc.citation.conferencePlace |
Virtual |
- |
dc.citation.endPage |
551 |
- |
dc.citation.startPage |
543 |
- |
dc.citation.title |
International Conference on Database Systems for Advanced Applications |
- |
dc.contributor.author |
Kim, Junghoon |
- |
dc.contributor.author |
Lim, S. |
- |
dc.date.accessioned |
2024-01-31T20:39:13Z |
- |
dc.date.available |
2024-01-31T20:39:13Z |
- |
dc.date.created |
2022-09-08 |
- |
dc.date.issued |
2022-04-11 |
- |
dc.description.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. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG. |
- |
dc.identifier.bibliographicCitation |
International Conference on Database Systems for Advanced Applications, pp.543 - 551 |
- |
dc.identifier.doi |
10.1007/978-3-031-00123-9_42 |
- |
dc.identifier.issn |
0302-9743 |
- |
dc.identifier.scopusid |
2-s2.0-85129823357 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/76236 |
- |
dc.language |
영어 |
- |
dc.publisher |
Springer Science and Business Media Deutschland GmbH |
- |
dc.title |
(p, n)-core: Core Decomposition in Signed Networks |
- |
dc.type |
Conference Paper |
- |
dc.date.conferenceDate |
2022-04-11 |
- |