Similar Group Finding Algorithm Based on Temporal Subgraph Matching

The similar group search is an important approach for the recommendation system or social network analysis. However, there is a negligence of the influence of temporal features of social network on the search for similarity group. In this paper, we model the social network through the temporal graph and define the similar group in the temporal social network. Then, the T-VF2 algorithm is designed to search the similarity group through the temporal subgraph matching technique. To evaluate our proposed algorithm, we also extend the VF2 algorithm by point-side collaborative filtering to perform temporal subgraph matching. Finally, lots of experiments show the effectiveness and efficient of our proposed algorithm.

[1]  Ambuj K. Singh,et al.  Mining Heavy Subgraphs in Time-Evolving Networks , 2011, 2011 IEEE 11th International Conference on Data Mining.

[2]  Lu Chen,et al.  Contextual Community Search Over Large Social Networks , 2019, 2019 IEEE 35th International Conference on Data Engineering (ICDE).

[3]  Junhu Wang,et al.  Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs , 2015, Proc. VLDB Endow..

[4]  Francesca Spezzano,et al.  A Scalable Graph-Coarsening Based Index for Dynamic Graph Databases , 2017, CIKM.

[5]  Jiawei Han,et al.  On graph query optimization in large networks , 2010, Proc. VLDB Endow..

[6]  Xin Wang,et al.  Querying big graphs within bounded resources , 2014, SIGMOD Conference.

[7]  Mehmet A. Orgun,et al.  Multi-Constrained Graph Pattern Matching in large-scale contextual social graphs , 2015, 2015 IEEE 31st International Conference on Data Engineering.

[8]  Jianxin Li,et al.  Community Aware Personalized Hashtag Recommendation in Social Networks , 2018, AusDM.

[9]  Tinghuai Ma,et al.  A novel subgraph K+\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K^{+}$$\end{document}-isomorphism method in social , 2017, Soft Computing.

[10]  Konstantinos Tserpes,et al.  Predicting Edge Signs in Social Networks Using Frequent Subgraph Discovery , 2014, IEEE Internet Computing.

[11]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[12]  V. S. Subrahmanian,et al.  SMAC: Subgraph Matching and Centrality in Huge Social Networks , 2013, 2013 International Conference on Social Computing.

[13]  George Kollios,et al.  GRECS: Graph Encryption for Approximate Shortest Distance Queries , 2015, IACR Cryptol. ePrint Arch..

[14]  Mario Vento,et al.  A (sub)graph isomorphism algorithm for matching large graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Lijun Chang,et al.  Scalable Subgraph Enumeration in MapReduce , 2015, Proc. VLDB Endow..

[16]  Lei Zou,et al.  A novel spectral coding in a large graph database , 2008, EDBT '08.

[17]  Rakesh Nagi,et al.  Searching social networks for subgraph patterns , 2013, Defense, Security, and Sensing.

[18]  Lijun Chang,et al.  Scalable subgraph enumeration in MapReduce: a cost-oriented approach , 2017, The VLDB Journal.

[19]  Lei Zou,et al.  Privacy Preserving Subgraph Matching on Large Graphs in Cloud , 2016, SIGMOD Conference.

[20]  Ambuj K. Singh,et al.  Graphs-at-a-time: query language and access methods for graph databases , 2008, SIGMOD Conference.

[21]  Yang Wang,et al.  MCS-GPM: Multi-Constrained Simulation Based Graph Pattern Matching in Contextual Social Graphs , 2018, IEEE Transactions on Knowledge and Data Engineering.