Error-tolerant graph matching using node contraction

被引：8
|
作者：
Dwivedi, Shri Prakash [1 ]
Singh, Ravi Shankar [1 ]
机构：
[1] Indian Inst Technol BHU, Dept Comp Sci & Engn, Varanasi, Uttar Pradesh, India
来源：
PATTERN RECOGNITION LETTERS | 2018年 / 116卷
关键词：
Graph matching; Graph edit distance; Structural pattern recognition; ATTRIBUTED RELATIONAL GRAPHS; EDIT DISTANCE; PATTERN-RECOGNITION; COMPUTATION; SEARCH;
D O I：
10.1016/j.patrec.2018.09.014
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Graph matching is the task of computing the similarity between two graphs. It is widely used in graph-based structural pattern recognition. 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 in 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 matching using node contraction where the given graph is transformed into another graph by contracting smaller degree nodes. We use this scheme to extend the notion of graph edit distance, which can be used as a trade-off between execution time and accuracy requirements of various graph matching applications. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码：58 / 64
页数：7
相关论文
共 50 条
  • [1] Error-Tolerant Graph Matching Using Homeomorphism
    Dwivedi, Prakash
    Singh, Ravi Shankar
    [J]. 2017 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2017, : 1762 - 1766
  • [2] Error-tolerant approximate graph matching utilizing node centrality information
    Dwivedi, Shri Prakash
    Singh, Ravi Shankar
    [J]. PATTERN RECOGNITION LETTERS, 2020, 133 : 313 - 319
  • [3] A Graph Repository for Learning Error-Tolerant Graph Matching
    Francisco Moreno-Garcia, Carlos
    Cortes, Xavier
    Serratosa, Francesc
    [J]. STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, S+SSPR 2016, 2016, 10029 : 519 - 529
  • [4] Secure Error-Tolerant Graph Matching Protocols
    Mandal, Kalikinkar
    Alomair, Basel
    Poovendran, Radha
    [J]. CRYPTOLOGY AND NETWORK SECURITY, CANS 2016, 2016, 10052 : 265 - 283
  • [5] Error-tolerant geometric graph similarity and matching
    Dwivedi, Shri Prakash
    Singh, Ravi Shankar
    [J]. PATTERN RECOGNITION LETTERS, 2019, 125 : 625 - 631
  • [6] Relevance criteria for data mining using error-tolerant graph matching
    Gautama, Sidharta
    Bellens, Rik
    De Tre, Guy
    D'Haeyer, Johan
    [J]. COMBINATORIAL IMAGE ANALYSIS, PROCEEDINGS, 2006, 4040 : 277 - 290
  • [7] A convolution edit kernel for error-tolerant graph matching
    Neuhaus, Michel
    Bunke, Horst
    [J]. 18TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 4, PROCEEDINGS, 2006, : 220 - +
  • [8] Relevance criteria for spatial information retrieval using error-tolerant graph matching
    Gautama, Sidharta
    Bellens, Rik
    De Tre, Guy
    Philips, Wilfried
    [J]. IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2007, 45 (04): : 810 - 817
  • [9] Error-tolerant graph matching in linear computational cost using an initial small partial matching
    Santacruz, Pep
    Serratosa, Francesc
    [J]. PATTERN RECOGNITION LETTERS, 2020, 134 : 10 - 19
  • [10] Error-Tolerant Geometric Graph Similarity
    Dwivedi, Shri Prakash
    Singh, Ravi Shankar
    [J]. STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, S+SSPR 2018, 2018, 11004 : 337 - 344
12345