DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bu, Fanchen | ko |
dc.contributor.author | Lee, Geon | ko |
dc.contributor.author | Shin, Kijung | ko |
dc.date.accessioned | 2023-10-25T01:00:46Z | - |
dc.date.available | 2023-10-25T01:00:46Z | - |
dc.date.created | 2023-08-22 | - |
dc.date.created | 2023-08-22 | - |
dc.date.issued | 2023-11 | - |
dc.identifier.citation | DATA MINING AND KNOWLEDGE DISCOVERY, v.37, no.6, pp.2389 - 2437 | - |
dc.identifier.issn | 1384-5810 | - |
dc.identifier.uri | http://hdl.handle.net/10203/313761 | - |
dc.description.abstract | Hypergraphs are a powerful abstraction for modeling high-order relations, which are ubiquitous in many fields. A hypergraph consists of nodes and hyperedges (i.e., subsets of nodes); and there have been a number of attempts to extend the notion of k-cores, which proved useful with numerous applications for pairwise graphs, to hypergraphs. However, the previous extensions are based on an unrealistic assumption that hyperedges are fragile, i.e., a high-order relation becomes obsolete as soon as a single member leaves it.In this work, we propose a new substructure model, called (k, t)-hypercore, based on the assumption that high-order relations remain as long as at least t fraction of the members remains. Specifically, it is defined as the maximal subhypergraph where (1) every node is contained in at least k hyperedges in it and (2) at least t fraction of the nodes remain in every hyperedge. We first prove that, given t (or k ), finding the (k,t)-hypercore for every possible k (or t ) can be computed in time linear w.r.t the sum of the sizes of hyperedges. Then, we demonstrate that real-world hypergraphs from the same domain share similar (k, t)-hypercore structures, which capture different perspectives depending on t. Lastly, we show the successful applications of our model in identifying influential nodes, dense substructures, and vulnerability in hypergraphs. | - |
dc.language | English | - |
dc.publisher | SPRINGER | - |
dc.title | Hypercore decomposition for non-fragile hyperedges: concepts, algorithms, observations, and applications | - |
dc.type | Article | - |
dc.identifier.wosid | 001044721800001 | - |
dc.identifier.scopusid | 2-s2.0-85167347613 | - |
dc.type.rims | ART | - |
dc.citation.volume | 37 | - |
dc.citation.issue | 6 | - |
dc.citation.beginningpage | 2389 | - |
dc.citation.endingpage | 2437 | - |
dc.citation.publicationname | DATA MINING AND KNOWLEDGE DISCOVERY | - |
dc.identifier.doi | 10.1007/s10618-023-00956-2 | - |
dc.contributor.localauthor | Shin, Kijung | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Hypergraphs mining | - |
dc.subject.keywordAuthor | k-cores | - |
dc.subject.keywordAuthor | Cohesive substructure models | - |
dc.subject.keywordAuthor | Real-world hypergraph analysis | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.