Multi-Constrained Graph Pattern Matching in large-scale contextual social graphs

Guanfeng Liu, Kai Zheng, Yan Wang, Mehmet A. Orgun, An Liu, Lei Zhao, Xiaofang Zhou

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

30 Citations (Scopus)

Abstract

Graph Pattern Matching (GPM) plays a significant role in social network analysis, which has been widely used in, for example, experts finding, social community mining and social position detection. Given a pattern graph GQ and a data graph GD, a GPM algorithm finds those subgraphs, GM, that match GQ in GD. However, the existing GPM methods do not consider the multiple constraints on edges in GQ, which are commonly exist in various applications such as, crowdsourcing travel, social network based e-commerce and study group selection, etc. In this paper, we first conceptually extend Bounded Simulation to Multi-Constrained Simulation (MCS), and propose a novel NP-Complete Multi-Constrained Graph Pattern Matching (MC-GPM) problem. Then, to address the efficiency issue in large-scale MC-GPM, we propose a new concept called Strong Social Component (SSC), consisting of participants with strong social connections. We also propose an approach to identify SSCs, and propose a novel index method and a graph compression method for SSC. Moreover, we devise a heuristic algorithm to identify MC-GPM results effectively and efficiently without decompressing graphs. An extensive empirical study on five real-world large-scale social graphs has demonstrated the effectiveness, efficiency and scalability of our approach.

Original languageEnglish
Title of host publication2015 IEEE 31st International Conference on Data Engineering, ICDE 2015
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages351-362
Number of pages12
Volume2015-May
ISBN (Electronic)9781479979639
DOIs
Publication statusPublished - 26 May 2015
Event2015 31st IEEE International Conference on Data Engineering, ICDE 2015 - Seoul, Korea, Republic of
Duration: 13 Apr 201517 Apr 2015

Other

Other2015 31st IEEE International Conference on Data Engineering, ICDE 2015
CountryKorea, Republic of
CitySeoul
Period13/04/1517/04/15

Fingerprint Dive into the research topics of 'Multi-Constrained Graph Pattern Matching in large-scale contextual social graphs'. Together they form a unique fingerprint.

  • Cite this

    Liu, G., Zheng, K., Wang, Y., Orgun, M. A., Liu, A., Zhao, L., & Zhou, X. (2015). Multi-Constrained Graph Pattern Matching in large-scale contextual social graphs. In 2015 IEEE 31st International Conference on Data Engineering, ICDE 2015 (Vol. 2015-May, pp. 351-362). [7113297] Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/ICDE.2015.7113297