research-article

Butterfly-core community search over labeled graphs

Authors:

Hui XiongAuthors Info & Claims

Proceedings of the VLDB Endowment, Volume 14, Issue 11

Pages 2006 - 2018

https://doi.org/10.14778/3476249.3476258

Published: 01 July 2021 Publication History

Abstract

Community search aims at finding densely connected subgraphs for query vertices in a graph. While this task has been studied widely in the literature, most of the existing works only focus on finding homogeneous communities rather than heterogeneous communities with different labels. In this paper, we motivate a new problem of cross-group community search, namely Butterfly-Core Community (BCC), over a labeled graph, where each vertex has a label indicating its properties and an edge between two vertices indicates their cross relationship. Specifically, for two query vertices with different labels, we aim to find a densely connected cross community that contains two query vertices and consists of butterfly networks, where each wing of the butterflies is induced by a k-core search based on one query vertex and two wings are connected by these butterflies. We first develop a heuristic algorithm achieving 2-approximation to the optimal solution. Furthermore, we design fast techniques of query distance computations, leader pair identifications, and index-based BCC local explorations. Extensive experiments on seven real datasets and four useful case studies validate the effectiveness and efficiency of our BCC and its multi-labeled extension models.

References

[1]

https://raw.githubusercontent.com/jpatokal/openflights/master/data/routes.dat.

[2]

https://wits.worldbank.org/datadownload.aspx?lang=en.

[3]

https://github.com/efekarakus/potter-network.

[4]

https://www.aminer.cn/citation.

[5]

Ahmed Al-Baghdadi and Xiang Lian. 2020. Topic-based community search over spatial-social networks. PVLDB 13, 12 (2020), 2104--2117.

Digital Library

[6]

Nicola Barbieri, Francesco Bonchi, Edoardo Galimberti, and Francesco Gullo. 2015. Efficient and effective community search. DMKD 29, 5 (2015), 1406--1433.

Digital Library

[7]

Vladimir Batagelj and Matjaz Zaversnik. 2003. An O (m) algorithm for cores decomposition of networks. arXiv preprint cs/0310049 (2003).

[8]

Fei Bi, Lijun Chang, Xuemin Lin, and Wenjie Zhang. 2018. An Optimal and Progressive Approach to Online Search of Top-K Influential Communities. PVLDB 11, 9 (2018), 1056--1068.

Digital Library

[9]

Stephen P Borgatti and Martin G Everett. 1997. Network analysis of 2-mode data. Social networks 19, 3 (1997), 243--270.

[10]

Cécile Bothorel, Juan David Cruz, Matteo Magnani, and Barbora Micenkova. 2015. Clustering attributed graphs: models, measures and methods. Network Science 3, 3 (2015), 408--444.

[11]

Lu Chen, Chengfei Liu, Kewen Liao, Jianxin Li, and Rui Zhou. 2019. Contextual community search over large social networks. In ICDE. 88--99.

[12]

Lu Chen, Chengfei Liu, Rui Zhou, Jianxin Li, Xiaochun Yang, and Bin Wang. 2018. Maximum co-located community search in large scale social networks. PVLDB 11, 10 (2018), 1233--1246.

Digital Library

[13]

Lu Chen, Chengfei Liu, Rui Zhou, Jiajie Xu, Jeffrey Xu Yu, and Jianxin Li. 2020. Finding Effective Geo-social Group for Impromptu Activities with Diverse Demands. In KDD. 698--708.

[14]

Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2009. Introduction to algorithms. MIT press. 1--1313 pages.

Digital Library

[15]

Wanyun Cui, Yanghua Xiao, Haixun Wang, Yiqi Lu, and Wei Wang. 2013. Online search of overlapping communities. In SIGMOD. 277--288.

Digital Library

[16]

Wanyun Cui, Yanghua Xiao, Haixun Wang, and Wei Wang. 2014. Local search of communities in large graphs. In SIGMOD. 991--1002.

Digital Library

[17]

Tyler Derr, Cassidy Johnson, Yi Chang, and Jiliang Tang. 2019. Balance in signed bipartite networks. In CIKM. 1221--1230.

Digital Library

[18]

Zheng Dong, Xin Huang, Guorui Yuan, Hengshu Zhu, and Hui Xiong. 2021. Butterfly-Core Community Search over Labeled Graphs. arXiv preprint arXiv:2105.08628 (2021).

Digital Library

[19]

Yixiang Fang, Reynold Cheng, Siqiang Luo, and Jiafeng Hu. 2016. Effective community search for large attributed graphs. PVLDB (2016), 1233--1244.

Digital Library

[20]

Yixiang Fang, Xin Huang, Lu Qin, Ying Zhang, Wenjie Zhang, Reynold Cheng, and Xuemin Lin. 2019. A survey of community search over big graphs. VLDBJ (2019), 1--40.

[21]

Yixiang Fang, Zhongran Wang, Reynold Cheng, Hongzhi Wang, and Jiafeng Hu. 2018. Effective and efficient community search over large directed graphs. TKDE 31, 11 (2018), 2093--2107.

[22]

Yixiang Fang, Yixing Yang, Wenjie Zhang, Xuemin Lin, and Xin Cao. 2020. Effective and efficient community search over large heterogeneous information networks. PVLDB 13, 6 (2020), 854--867.

Digital Library

[23]

Fangda Guo, Ye Yuan, Guoren Wang, Xiangguo Zhao, and Hao Sun. 2021. Multi-attributed Community Search in Road-social Networks. arXiv preprint arXiv:2101.09668 (2021), 109--120.

[24]

Xin Huang and Laks VS Lakshmanan. 2017. Attribute-driven community search. PVLDB 10, 9 (2017), 949--960.

Digital Library

[25]

Xin Huang, Laks VS Lakshmanan, and Jianliang Xu. 2019. Community Search over Big Graphs. Morgan & Claypool Publishers. 1--206 pages.

Digital Library

[26]

Xin Huang, Laks VS Lakshmanan, Jeffrey Xu Yu, and Hong Cheng. 2015. Approximate closest community search in networks. PVLDB (2015), 276--287.

Digital Library

[27]

Xun Jian, Yue Wang, and Lei Chen. 2020. Effective and Efficient Relational Community Detection and Search in Large Dynamic Heterogeneous Information Networks. PVLDB 13, 10 (2020), 1723--1736.

Digital Library

[28]

Yuli Jiang, Xin Huang, Hong Cheng, and Jeffrey Xu Yu. 2018. Vizcs: Online searching and visualizing communities in dynamic graphs. In ICDE. IEEE, 1585--1588.

[29]

Junghoon Kim, Tao Guo, Kaiyu Feng, Gao Cong, Arijit Khan, and Farhana M Choudhury. 2020. Densely connected user community and location cluster search in location-based social networks. In SIGMOD. 2199--2209.

Digital Library

[30]

Conggai Li, Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, and Xuemin Lin. 2019. Efficient progressive minimum k-core search. PVLDB 13, 3 (2019), 362--375.

Digital Library

[31]

Jianxin Li, Xinjue Wang, Ke Deng, Xiaochun Yang, Timos Sellis, and Jeffrey Xu Yu. 2017. Most influential community search over large social networks. In ICDE. 871--882.

[32]

Rundong Li, Pinghui Wang, Peng Jia, Xiangliang Zhang, Junzhou Zhao, Jing Tao, Ye Yuan, and Xiaohong Guan. 2021. Approximately Counting Butterflies in Large Bipartite Graph Streams. TKDE (2021).

[33]

Rong-Hua Li, Lu Qin, Jeffrey Xu Yu, and Rui Mao. 2015. Influential Community Search in Large Networks. PVLDB 8, 5 (2015), 509--520.

Digital Library

[34]

Zhe Lin, Fan Zhang, Xuemin Lin, Wenjie Zhang, and Zhihong Tian. 2021. Hierarchical core maintenance on large dynamic graphs. PVLDB 14, 5 (2021), 757--770.

Digital Library

[35]

Qing Liu, Minjun Zhao, Xin Huang, Jianliang Xu, and Yunjun Gao. 2020. Truss-based Community Search over Large Directed Graphs. In SIGMOD. 2183--2197.

Digital Library

[36]

Qing Liu, Yifan Zhu, Minjun Zhao, Xin Huang, Jianliang Xu, and Yunjun Gao. 2020. VAC: Vertex-Centric Attributed Community Search. In ICDE. 937--948.

[37]

Jiehuan Luo, Xin Cao, Xike Xie, Qiang Qu, Zhiqiang Xu, and Christian S Jensen. 2020. Efficient Attribute-Constrained Co-Located Community Search. In ICDE. 1201--1212.

[38]

Chuan Qin, Hengshu Zhu, Tong Xu, Chen Zhu, Liang Jiang, Enhong Chen, and Hui Xiong. 2018. Enhancing person-job fit for talent recruitment: An ability-aware neural network approach. In SIGIR. 25--34.

Digital Library

[39]

Garry Robins and Malcolm Alexander. 2004. Small worlds among interlocking directors: Network structure and distance in bipartite graphs. Computational & Mathematical Organization Theory 10, 1 (2004), 69--94.

Digital Library

[40]

Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariyuce, and Srikanta Tirthapura. 2018. Butterfly Counting in Bipartite Networks. In KDD. 2150--2159.

Digital Library

[41]

Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sariyüce, and Srikanta Tirthapura. 2019. FLEET: butterfly estimation from a bipartite graph stream. In CIKM. 1201--1210.

Digital Library

[42]

Ahmet Erdem Sariyüce and Ali Pinar. 2018. Peeling bipartite networks for dense subgraph discovery. In WSDM. 504--512.

Digital Library

[43]

Stephen B Seidman. 1983. Network structure and minimum degree. Social networks 5, 3 (1983), 269--287.

[44]

Mauro Sozio and Aristides Gionis. 2010. The community-search problem and how to plan a successful cocktail party. In KDD. 939--948.

Digital Library

[45]

Longxu Sun, Xin Huang, Rong-Hua Li, and Jianliang Xu. 2019. Fast Algorithms for Intimate-Core Group Search in Weighted Graphs. In WISE. 728--744.

[46]

Yizhou Sun and Jiawei Han. 2013. Mining heterogeneous information networks: a structural analysis approach. ACM SIGKDD Explorations Newsletter (2013), 20--28.

Digital Library

[47]

Ying Sun, Fuzhen Zhuang, Hengshu Zhu, Xin Song, Qing He, and Hui Xiong. 2019. The impact of person-organization fit on talent management: A structure-aware convolutional neural network approach. In KDD. 1625--1633.

Digital Library

[48]

Ying Sun, Fuzhen Zhuang, Hengshu Zhu, Qi Zhang, Qing He, and Hui Xiong. 2021. Market-oriented job skill valuation with cooperative composition neural network. Nature communications 12, 1 (2021), 1--12.

[49]

Jie Tang, Jing Zhang, Limin Yao, Juanzi Li, Li Zhang, and Zhong Su. 2008. Arnet-miner: extraction and mining of academic social networks. In KDD. 990--998.

Digital Library

[50]

Chaokun Wang and Junchao Zhu. 2019. Forbidden nodes aware community search. In AAAI, Vol. 33. 758--765.

[51]

Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, and Ying Zhang. 2019. Vertex priority based butterfly counting for large-scale bipartite networks. PVLDB 12, 10 (2019), 1139--1152.

Digital Library

[52]

Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, and Ying Zhang. 2020. Efficient bitruss decomposition for large-scale bipartite graphs. In ICDE. 661--672.

[53]

Yubao Wu, Ruoming Jin, Jing Li, and Xiang Zhang. 2015. Robust local community detection: on free rider effect and its elimination. PVLDB 8, 7 (2015), 798--809.

Digital Library

[54]

Yixing Yang, Yixiang Fang, Maria E Orlowska, Wenjie Zhang, and Xuemin Lin. 2021. Efficient bi-triangle counting for large bipartite networks. PVLDB 14, 6 (2021), 984--996.

Digital Library

[55]

Kai Yao and Lijun Chang. 2021. Efficient Size-Bounded Community Search over Large Networks. PVLDB 14, 8 (2021), 1441--1453.

Digital Library

[56]

Yuyang Ye, Hengshu Zhu, Tong Xu, Fuzhen Zhuang, Runlong Yu, and Hui Xiong. 2019. Identifying high potential talent: A neural network based dynamic social profiling approach. In ICDM. IEEE, 718--727.

[57]

Long Yuan, Lu Qin, Wenjie Zhang, Lijun Chang, and Jianye Yang. 2017. Index-based densest clique percolation community search in networks. TKDE 30, 5 (2017), 922--935.

[58]

Zhiwei Zhang, Xin Huang, Jianliang Xu, Byron Choi, and Zechao Shang. 2019. Keyword-Centric Community Search. In ICDE. 422--433.

[59]

Dong Zheng, Jianquan Liu, Rong-Hua Li, Cigdem Aslay, Yi-Cheng Chen, and Xin Huang. 2017. Querying intimate-core groups in weighted graphs. In ICSC. 156--163.

[60]

Yang Zhou, Hong Cheng, and Jeffrey Xu Yu. 2009. Graph clustering based on structural/attribute similarities. PVLDB (2009), 718--729.

Digital Library

Cited By

Hang JHong ZFeng XWang GCao DQiao JWang HZhang D(2024)Complex-Path: Effective and Efficient Node Ranking with Paths in Billion-Scale Heterogeneous GraphsProceedings of the VLDB Endowment10.14778/3685800.368582017:12(3973-3986)Online publication date: 8-Nov-2024
https://dl.acm.org/doi/10.14778/3685800.3685820
Ni LYe RLuo WZhang Y(2024)Local Community Detection in Multiple Private NetworksACM Transactions on Knowledge Discovery from Data10.1145/364407818:5(1-21)Online publication date: 10-Feb-2024
https://dl.acm.org/doi/10.1145/3644078
Hang JHong ZFeng XWang GYang GLi FSong XZhang DBaeza-Yates RBonchi F(2024)Paths2Pair: Meta-path Based Link Prediction in Billion-Scale Commercial Heterogeneous GraphsProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671563(5082-5092)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671563
Show More Cited By

Index Terms

Butterfly-core community search over labeled graphs
1. Information systems
  1. Information retrieval
  2. Information systems applications
    1. Data mining
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Index terms have been assigned to the content through auto-classification.

Recommendations

Enumerating and generating labeled k-degenerate graphs
ALENEX '10: Proceedings of the Meeting on Algorithm Engineering & Expermiments

A k-degenerate graph is a graph in which every induced subgraph has a vertex with degree at most k. The class of k-degenerate graphs is interesting from a theoretical point of view and it plays an interesting role in the theory of fixed parameter ...
Some Distance Antimagic Labeled Graphs
CALDAM 2016: Proceedings of the Second International Conference on Algorithms and Discrete Applied Mathematics - Volume 9602

Let G be a graph of order n. A bijection $$f:VG \longrightarrow \{1, 2, \ldots , n\}$$ is said to be distance antimagic if for every vertex v the vertex weight defined by $$w_fv =\sum _{x\in Nv}fx$$ is distinct. The graph which admits such a labeling is ...
Balanced group-labeled graphs

A group-labeled graph is a graph whose vertices and edges have been assigned labels from some abelian group. The weight of a subgraph of a group-labeled graph is the sum of the labels of the vertices and edges in the subgraph. A group-labeled graph is ...

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the VLDB Endowment

Proceedings of the VLDB Endowment Volume 14, Issue 11

July 2021

732 pages

ISSN:2150-8097

Editors:
Xin Luna Dong
Amazon
,
Felix Naumann
HPI, University of Potsdam

Issue’s Table of Contents

Publisher

VLDB Endowment

Publication History

Published: 01 July 2021

Published in PVLDB Volume 14, Issue 11

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
77
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)0

Reflects downloads up to 20 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Hang JHong ZFeng XWang GCao DQiao JWang HZhang D(2024)Complex-Path: Effective and Efficient Node Ranking with Paths in Billion-Scale Heterogeneous GraphsProceedings of the VLDB Endowment10.14778/3685800.368582017:12(3973-3986)Online publication date: 8-Nov-2024
https://dl.acm.org/doi/10.14778/3685800.3685820
Ni LYe RLuo WZhang Y(2024)Local Community Detection in Multiple Private NetworksACM Transactions on Knowledge Discovery from Data10.1145/364407818:5(1-21)Online publication date: 10-Feb-2024
https://dl.acm.org/doi/10.1145/3644078
Hang JHong ZFeng XWang GYang GLi FSong XZhang DBaeza-Yates RBonchi F(2024)Paths2Pair: Meta-path Based Link Prediction in Billion-Scale Commercial Heterogeneous GraphsProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671563(5082-5092)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671563
Chen LLiu CZhou RLiao KXu JLi J(2023)Densest Multipartite Subgraph Search in Heterogeneous Information NetworksProceedings of the VLDB Endowment10.14778/3636218.363622617:4(699-711)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.14778/3636218.3636226
Zhou YFang YLuo WYe Y(2023)Influential Community Search over Large Heterogeneous Information NetworksProceedings of the VLDB Endowment10.14778/3594512.359453216:8(2047-2060)Online publication date: 1-Apr-2023
https://dl.acm.org/doi/10.14778/3594512.3594532
Behrouz AHashemi FLakshmanan L(2023)FirmTruss Community Search in Multilayer NetworksProceedings of the VLDB Endowment10.14778/3570690.357070016:3(505-518)Online publication date: 23-Jan-2023
https://dl.acm.org/doi/10.14778/3570690.3570700
Zhang FLinghu QXie JWang KLin XZhang WSingh ASun YAkoglu LGunopulos DYan XKumar ROzcan FYe J(2023)Quantifying Node Importance over Network Structural StabilityProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3580305.3599480(3217-3228)Online publication date: 6-Aug-2023
https://dl.acm.org/doi/10.1145/3580305.3599480
Hashemi FBehrouz ARezaei Hajidehi M(2023)CS-TGN: Community Search via Temporal Graph Neural NetworksCompanion Proceedings of the ACM Web Conference 202310.1145/3543873.3587654(1196-1203)Online publication date: 30-Apr-2023
https://dl.acm.org/doi/10.1145/3543873.3587654
Zhou KXin JChen JZhang XWang BWang Z(2023)Effective and efficient community search with size constraint on bipartite graphsInformation Sciences: an International Journal10.1016/j.ins.2023.119511647:COnline publication date: 1-Nov-2023
https://dl.acm.org/doi/10.1016/j.ins.2023.119511
Lou YWang CGu TFeng HChen JYu J(2023)Time-topology analysis on temporal graphsThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-022-00772-y32:4(815-843)Online publication date: 6-Jan-2023
https://dl.acm.org/doi/10.1007/s00778-022-00772-y
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents