MuMod: A Micro-Unit Connection Approach for Hybrid-Order Community Detection
Ling Huang, Hong-Yang Chao, Guangqiang Xie
Abstract
In the past few years, higher-order community detection has drawn an increasing amount of attention. Compared with the lower-order approaches that rely on the connectivity pattern of individual nodes and edges, the higher-order approaches discover communities by leveraging the higher-order connectivity pattern via constructing a motif-based hypergraph. Despite success in capturing the building blocks of complex networks, recent study has shown that the higher-order approaches unavoidably suffer from the hypergraph fragmentation issue. Although an edge enhancement strategy has been designed previously to address this issue, adding additional edges may corrupt the original lower-order connectivity pattern. To this end, this paper defines a new problem of community detection, namely hybrid-order community detection, which aims to discover communities by simultaneously leveraging the lower-order connectivity pattern and the higherorder connectivity pattern. For addressing this new problem, a new Micro-unit Modularity (MuMod) approach is designed. The basic idea lies in constructing a micro-unit connection network, where both of the lower-order connectivity pattern and the higher-order connectivity pattern are utilized. And then a new micro-unit modularity model is proposed for generating the micro-unit groups, from which the overlapping community structure of the original network can be derived. Extensive experiments are conducted on five real-world networks. Comparison results with twelve existing approaches confirm the effectiveness of the proposed method.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 0d124946-b72a-4067-ae18-354f82cbdc6bCited by top-tier papers2
- Hybrid-order Stochastic Block ModelXunxun Wu, Chang-Dong Wang, Pengfei JiaoAAAI 2021 · 6 citations
- PSMC: Provable and Scalable Algorithms for Motif Conductance Based Graph ClusteringLonglong Lin, Tao Jia, Zeli Wang, Jin Zhao et al.KDD 2024 · 3 citations
Related papers
- Hypergraph Motif Representation LearningAlessia Antelmi, Gennaro Cordasco, Daniele De Vinco, Valerio Di Pasquale et al.KDD 2025 · 1 citation
- Motif Cut SparsifiersMichael Kapralov, Mikhail Makarov, Sandeep Silwal, Christian Sohler et al.FOCS 2022
- On Analyzing Graphs with Motif-PathsXiaodong Li, Reynold Cheng, Kevin Chen-Chuan Chang, Caihua Shan et al.VLDB 2021 · 27 citations
- 3Mformer: Multi-order Multi-mode Transformer for Skeletal Action RecognitionLei Wang, Piotr KoniuszCVPR 2023
- Clustering in graphs and hypergraphs with categorical edge labelsIlya Amburg, Nate Veldt, Austin R. BensonWWW 2020 · 118 citations
