Error-Tolerant Geometric Graph Similarity

被引:3
|
作者
Dwivedi, Shri Prakash [1 ]
Singh, Ravi Shankar [1 ]
机构
[1] Indian Inst Technol BHU, Dept Comp Sci & Engn, Varanasi, Uttar Pradesh, India
来源
STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, S+SSPR 2018 | 2018年 / 11004卷
关键词
Graph matching; Geometric graph; Graph distance; ATTRIBUTED RELATIONAL GRAPHS; EDIT DISTANCE; COMPUTATION; SEARCH;
D O I
10.1007/978-3-319-97785-0_32
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Graph matching is the task of computing the similarity between two graphs. Error-tolerant graph matching is a type of graph matching, in which a similarity between two graphs is computed based on some tolerance value whereas within exact graph matching a strict one-to-one correspondence is required between two graphs. In this paper, we present an approach to error-tolerant graph similarity using geometric graphs. We define the vertex distance (dissimilarity) and edge distance between two graphs and combine them to compute graph distance.
引用
收藏
页码:337 / 344
页数:8
相关论文
共 50 条
  • [31] Ligand Binding Site Similarity Identification Based on Chemical and Geometric Similarity
    Tu, Haibo
    Shi, Tieliu
    PROTEIN JOURNAL, 2013, 32 (05) : 373 - 385
  • [32] A Hungarian Algorithm for Error-Correcting Graph Matching
    Bougleux, Sebastien
    Gauzere, Benoit
    Brun, Luc
    GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION (GBRPR 2017), 2017, 10310 : 118 - 127
  • [33] Efficient Graph Similarity Search Over Large Graph Databases
    Zheng, Weiguo
    Zou, Lei
    Lian, Xiang
    Wang, Dong
    Zhao, Dongyan
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2015, 27 (04) : 964 - 978
  • [34] Multilevel Graph Matching Networks for Deep Graph Similarity Learning
    Ling, Xiang
    Wu, Lingfei
    Wang, Saizhuo
    Ma, Tengfei
    Xu, Fangli
    Liu, Alex X.
    Wu, Chunming
    Ji, Shouling
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2023, 34 (02) : 799 - 813
  • [35] Graph partitioning and graph neural network based hierarchical graph matching for graph similarity computation
    Xu, Haoyan
    Duan, Ziheng
    Wang, Yueyang
    Feng, Jie
    Chen, Runjian
    Zhang, Qianru
    Xu, Zhongbin
    NEUROCOMPUTING, 2021, 439 : 348 - 362
  • [36] Deep graph similarity learning: a survey
    Guixiang Ma
    Nesreen K. Ahmed
    Theodore L. Willke
    Philip S. Yu
    Data Mining and Knowledge Discovery, 2021, 35 : 688 - 725
  • [37] Metric Indexing for Graph Similarity Search
    Bause, Franka
    Blumenthal, David B.
    Schubert, Erich
    Kriege, Nils M.
    SIMILARITY SEARCH AND APPLICATIONS, SISAP 2021, 2021, 13058 : 323 - 336
  • [38] Path similarity skeleton graph matching
    Bai, Xiang
    Latecki, Longin Jan
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2008, 30 (07) : 1282 - 1292
  • [39] Deep graph similarity learning: a survey
    Ma, Guixiang
    Ahmed, Nesreen K.
    Willke, Theodore L.
    Yu, Philip S.
    DATA MINING AND KNOWLEDGE DISCOVERY, 2021, 35 (03) : 688 - 725
  • [40] Efficient Top-k Graph Similarity Search With GED Constraints
    Kim, Jongik
    IEEE ACCESS, 2022, 10 : 79180 - 79191