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 条
  • [31] Finding events in temporal networks: segmentation meets densest subgraph discovery
    Rozenshtein P.
    Bonchi F.
    Gionis A.
    Sozio M.
    Tatti N.
    Rozenshtein, Polina (polina.rozenshtein@aalto.fi), 1611, Springer Science and Business Media Deutschland GmbH (62): : 1611 - 1639
  • [32] Research on subgraph matching optimization based on GPU
    Li A.-T.
    Cui P.-J.
    Yuan Y.
    Wang G.-R.
    Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science), 2023, 57 (09): : 1856 - 1864
  • [33] WSM: a novel algorithm for subgraph matching in large weighted graphs
    Anupam Bhattacharjee
    Hasan M. Jamil
    Journal of Intelligent Information Systems, 2012, 38 : 767 - 784
  • [34] WSM: a novel algorithm for subgraph matching in large weighted graphs
    Bhattacharjee, Anupam
    Jamil, Hasan M.
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2012, 38 (03) : 767 - 784
  • [35] Finding similar RSS news articles using correlation-based phrase matching
    Pera, Maria Soledad
    Ng, Yiu-Kai
    KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, 2007, 4798 : 336 - +
  • [36] An Efficient Dynamic Programming Algorithm for Finding Group Steiner Trees in Temporal Graphs
    Ge, Youming
    Chen, Zitong
    Kong, Weiyang
    Liu, Yubao
    Wong, Raymond Chi-Wing
    Zhang, Sen
    INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2023, 2023
  • [37] Finding Heterophilic Neighbors via Confidence-based Subgraph Matching for Semi-supervised Node Classification
    Choi, Yoonhyuk
    Choi, Jiho
    Ko, Taewook
    Byun, Hyungho
    Kim, Chong-Kwon
    PROCEEDINGS OF THE 31ST ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2022, 2022, : 283 - 292
  • [38] A Star Identification Algorithm Based on Group-matching
    Pei Ran
    Hao Yong
    Hou Yu-shi
    Xie Ya-en
    PROCEEDINGS 2013 INTERNATIONAL CONFERENCE ON MECHATRONIC SCIENCES, ELECTRIC ENGINEERING AND COMPUTER (MEC), 2013, : 1502 - 1505
  • [39] Ontology matching algorithm based on subgraph approximate isomorphic in pathology e-learning resource
    Ye, Huaqiao
    Huang, Chunguo
    Dai, Renjun
    BASIC & CLINICAL PHARMACOLOGY & TOXICOLOGY, 2019, 125 : 11 - 11
  • [40] A graph matching method and a graph matching distance based on subgraph assignments
    Raveaux, Romain
    Burie, Jean-Christophe
    Ogier, Jean-Marc
    PATTERN RECOGNITION LETTERS, 2010, 31 (05) : 394 - 406