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 条
  • [1] Error-tolerant geometric graph similarity and matching
    Dwivedi, Shri Prakash
    Singh, Ravi Shankar
    PATTERN RECOGNITION LETTERS, 2019, 125 : 625 - 631
  • [2] Error-tolerant graph matching using node contraction
    Dwivedi, Shri Prakash
    Singh, Ravi Shankar
    PATTERN RECOGNITION LETTERS, 2018, 116 : 58 - 64
  • [3] Error-Tolerant Graph Matching Using Homeomorphism
    Dwivedi, Prakash
    Singh, Ravi Shankar
    2017 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2017, : 1762 - 1766
  • [4] Error-tolerant approximate graph matching utilizing node centrality information
    Dwivedi, Shri Prakash
    Singh, Ravi Shankar
    PATTERN RECOGNITION LETTERS, 2020, 133 : 313 - 319
  • [5] A Graph Repository for Learning Error-Tolerant Graph Matching
    Francisco Moreno-Garcia, Carlos
    Cortes, Xavier
    Serratosa, Francesc
    STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, S+SSPR 2016, 2016, 10029 : 519 - 529
  • [6] Secure Error-Tolerant Graph Matching Protocols
    Mandal, Kalikinkar
    Alomair, Basel
    Poovendran, Radha
    CRYPTOLOGY AND NETWORK SECURITY, CANS 2016, 2016, 10052 : 265 - 283
  • [7] Novel kernels for error-tolerant graph classification
    Neuhaus, Michel
    Riesen, Kaspar
    Bunke, Horst
    SPATIAL VISION, 2009, 22 (05): : 425 - 441
  • [8] Error-Tolerant Geometric Quantum Control for Logical Qubits with Minimal Resources
    Chen, Tao
    Xue, Zheng-Yuan
    Wang, Z. D.
    PHYSICAL REVIEW APPLIED, 2022, 18 (01)
  • [9] Relevance criteria for spatial information retrieval using error-tolerant graph matching
    Gautama, Sidharta
    Bellens, Rik
    De Tre, Guy
    Philips, Wilfried
    IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2007, 45 (04): : 810 - 817
  • [10] A new algorithm for error-tolerant subgraph isomorphism detection
    Messmer, BT
    Bunke, H
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1998, 20 (05) : 493 - 504
12345