Similar Group Finding Algorithm Based on Temporal Subgraph Matching

被引:0
|
作者
Cai, Yizhu [1 ]
Li, Mo [1 ]
Xin, Junchang [1 ]
机构
[1] Northeastern Univ, Sch Comp Sci & Engn, Shenyang, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
ISOMORPHISM; ENUMERATION;
D O I
10.1007/978-3-030-35231-8_16
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:221 / 235
页数:15
相关论文
共 50 条
  • [21] A linear time algorithm for finding a maximal planar subgraph based on PC-trees
    Hsu, WL
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 787 - 797
  • [22] Hasse Diagram based Algorithm for Continuous Temporal Subgraph Query in Graph Stream
    Sun, Xiaoli
    Tan, Yusong
    Wu, Qingbo
    Wang, Jing
    PROCEEDINGS OF 2017 6TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2017), 2017, : 241 - 246
  • [23] Local matching of assemblies based on subgraph isomorphism and case matching
    College of Mechanical and Power Engineering, East China University of Science and Technology, Shanghai 200237, China
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao, 2 (299-305):
  • [24] A linear-time algorithm for finding a maximal planar subgraph
    Djidjev, Hristo N.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (02) : 444 - 462
  • [25] The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees
    Demeyer, Sofie
    Michoel, Tom
    Fostier, Jan
    Audenaert, Pieter
    Pickavet, Mario
    Demeester, Piet
    PLOS ONE, 2013, 8 (04):
  • [26] Finding Community Structure Based on Subgraph Similarity
    Xiang, Biao
    Chen, En-Hong
    Zhou, Tao
    COMPLEX NETWORKS, 2009, 207 : 73 - +
  • [27] Parallel organization algorithm for graph matching and subgraph isomorphism detection
    Nakanishi, Y
    Uehara, K
    DISCOVERY SCIENCE, 1998, 1532 : 407 - 408
  • [28] Probabilistic subgraph matching based on convex relaxation
    Schellewald, C
    Schnörr, C
    ENERGY MINIMIZATION METHODS IN COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, 2005, 3757 : 171 - 186
  • [29] PBSM: An Effcient Top-K Subgraph Matching Algorithm
    Chen, Wei
    Liu, Jia
    Chen, Ziyang
    Tang, Xian
    Li, Kaiyu
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2018, 32 (06)
  • [30] MPMatch: A Multi-Core Parallel Subgraph Matching Algorithm
    Jin, Xin
    Lai, Longbin
    2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOPS (ICDEW 2019), 2019, : 241 - 248