Hypergraph Motifs: Concepts, Algorithms, and Discoveries

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 164
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorLee, Geonko
dc.contributor.authorKo, Jihoonko
dc.contributor.authorShin, Kijungko
dc.date.accessioned2020-10-23T02:55:24Z-
dc.date.available2020-10-23T02:55:24Z-
dc.date.created2020-10-19-
dc.date.created2020-10-19-
dc.date.created2020-10-19-
dc.date.created2020-10-19-
dc.date.issued2020-07-
dc.identifier.citationPROCEEDINGS OF THE VLDB ENDOWMENT, v.13, no.11, pp.2256 - 2269-
dc.identifier.issn2150-8097-
dc.identifier.urihttp://hdl.handle.net/10203/276951-
dc.description.abstractHypergraphs naturally represent group interactions, which are omnipresent in many domains: collaborations of researchers, co-purchases of items, joint interactions of proteins, to name a few. In this work, we propose tools for answering the following questions in a systematic manner: (Q1) what are structural design principles of real-world hypergraphs? (Q2) how can we compare local structures of hypergraphs of di.erent sizes? (Q3) how can we identify domains which hypergraphs are from? We first define hypergraph motifs (h-motifs), which describe the connectivity patterns of three connected hyperedges. Then, we define the significance of each h-motif in a hypergraph as its occurrences relative to those in properly randomized hypergraphs. Lastly, we define the characteristic profile (CP) as the vector of the normalized significance of every h-motif. Regarding Q1, we find that h-motifs' occurrences in 11 real-world hypergraphs from 5 domains are clearly distinguished from those of randomized hypergraphs. In addition, we demonstrate that CPs capture local structural patterns unique to each domain, and thus comparing CPs of hypergraphs addresses Q2 and Q3. Our algorithmic contribution is to propose MoCHy, a family of parallel algorithms for counting h-motifs' occurrences in a hypergraph. We theoretically analyze their speed and accuracy, and we show empirically that the advanced approximate version MoCHy-A(+) is up to 25 x more accurate and 32. faster than the basic approximate and exact versions, respectively.-
dc.languageEnglish-
dc.publisherASSOC COMPUTING MACHINERY-
dc.titleHypergraph Motifs: Concepts, Algorithms, and Discoveries-
dc.typeArticle-
dc.identifier.wosid000573965600033-
dc.identifier.scopusid2-s2.0-85091060167-
dc.type.rimsART-
dc.citation.volume13-
dc.citation.issue11-
dc.citation.beginningpage2256-
dc.citation.endingpage2269-
dc.citation.publicationnamePROCEEDINGS OF THE VLDB ENDOWMENT-
dc.identifier.doi10.14778/3407790.3407823-
dc.contributor.localauthorShin, Kijung-
dc.contributor.nonIdAuthorLee, Geon-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordPlusNETWORK MOTIFS-
dc.subject.keywordPlusFRAMEWORK-
Appears in Collection
RIMS Journal Papers
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0