Advertisement

Similar Group Finding Algorithm Based on Temporal Subgraph Matching

  • Yizhu Cai
  • Mo Li
  • Junchang XinEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11888)

Abstract

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.

Notes

Acknowledgement

This work was supported in part by the National Natural Science Foundation of China (Nos. 61472069, 61402089 and U1401256), China Postdoctoral Science Foundation (Nos. 2019T120216 and 2018M641705), the Fundamental Research Funds for the Central Universities (Nos. N161602003, N180408019 and N180101028), the Open Program of Neusoft Institute of Intelligent Healthcare Technology, Co. Ltd. (No. NIMRIOP1802) and the fund of Acoustics Science and Technology Laboratory.

References

  1. 1.
    Alsini, A., Datta, A., Huynh, D.Q., Li, J.: Community Aware Personalized Hashtag Recommendation in Social Networks. In: Islam, R., Koh, Y.S., Zhao, Y., Warwick, G., Stirling, D., Li, C.-T., Islam, Z. (eds.) AusDM 2018. CCIS, vol. 996, pp. 216–227. Springer, Singapore (2019).  https://doi.org/10.1007/978-981-13-6661-1_17CrossRefGoogle Scholar
  2. 2.
    Bogdanov, P., Mongiovi, M., Singh, A.K.: Mining heavy subgraphs in time-evolving networks. In: ICDE, pp. 81–90 (2011)Google Scholar
  3. 3.
    Chang, Z., Zou, L., Li, F.: Privacy preserving subgraph matching on large graphs in cloud. In: SIGMOD, pp. 199–213 (2016)Google Scholar
  4. 4.
    Chen, L., Liu, C., Liao, K., Li, J., Zhou, R.: Contextual community search over large social networks. In: ICDE, pp. 88–99 (2019)Google Scholar
  5. 5.
    Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367–1372 (2004)CrossRefGoogle Scholar
  6. 6.
    Fan, W., Wang, X., Wu, Y.: Querying big graphs within bounded resources. In: SIGMOD, pp. 301–312 (2014)Google Scholar
  7. 7.
    He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: SIGMOD, pp. 405–418 (2008)Google Scholar
  8. 8.
    Kansal, A., Spezzano, F.: A scalable graph-coarsening based index for dynamic graph databases. In: CIKM, pp. 207–216 (2017)Google Scholar
  9. 9.
    Lai, L., Qin, L., Lin, X., Chang, L.: Scalable subgraph enumeration in mapreduce. Very Large Data Bases 8(10), 974–985 (2015)Google Scholar
  10. 10.
    Lai, L., Qin, L., Lin, X., Chang, L.: Scalable subgraph enumeration in mapreduce: a cost-oriented approach. Very Large Data Bases 26(3), 421–446 (2017)CrossRefGoogle Scholar
  11. 11.
    Liu, G., et al.: MCS-GPM: multi-constrained simulation based graph pattern matching in contextual social graphs. IEEE Trans. Knowl. Data Eng. 30(6), 1050–1064 (2018)CrossRefGoogle Scholar
  12. 12.
    Liu, G., et al.: Multi-constrained graph pattern matching in large-scale contextual social graphs. In: ICDE, pp. 351–362 (2015)Google Scholar
  13. 13.
    Meng, X., Kamara, S., Nissim, K., Kollios, G.: GRECS: graph encryption for approximate shortest distance queries. In: ACM, pp. 504–517 (2015)Google Scholar
  14. 14.
    Ogaard, K., Kase, S.E., Roy, H., Nagi, R., Sambhoos, K., Sudit, M.: Searching social networks for subgraph patterns. In: Proceedings of SPIE, vol. 8711 (2013)Google Scholar
  15. 15.
    Papaoikonomou, A., Kardara, M., Tserpes, K., Varvarigou, T.A.: Predicting edge signs in social networks using frequent subgraph discovery. IEEE Internet Comput. 18(5), 36–43 (2014)CrossRefGoogle Scholar
  16. 16.
    Park, N., Ovelgonne, M., Subrahmanian, V.S.: SMAC: subgraph matching and centrality in huge social networks. In: SocialCom, pp. 134–141 (2013)Google Scholar
  17. 17.
    Ren, X., Wang, J.: Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs. Very Large Data Bases 8(5), 617–628 (2015)Google Scholar
  18. 18.
    Rong, H., Ma, T., Tang, M., Cao, J.: A novel subgraph \(k^{+}\)-isomorphism method in social network based on graph similarity detection. Soft Comput. 22(8), 2583–2601 (2018)CrossRefGoogle Scholar
  19. 19.
    Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31–42 (1976)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Zhao, P., Han, J.: On graph query optimization in large networks. Very Large Data Bases 3(1), 340–351 (2010)Google Scholar
  21. 21.
    Zou, L., Chen, L., Yu, J.X., Lu, Y.: A novel spectral coding in a large graph database. In: EDBT, pp. 181–192 (2008)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.School of Computer Science and EngineeringNortheastern UniversityShenyangChina

Personalised recommendations