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 条
  • [41] A novel edge-centric approach for graph edit similarity computation
    Gouda, Karam
    Hassaan, Mosab
    INFORMATION SYSTEMS, 2019, 80 : 91 - 106
  • [42] Remarks on minorants of Laplacians on a geometric graph
    A. A. Vladimirov
    Mathematical Notes, 2015, 98 : 519 - 521
  • [43] A geometric graph model for coauthorship networks
    Xie, Zheng
    Ouyang, Zhenzheng
    Li, Jianping
    JOURNAL OF INFORMETRICS, 2016, 10 (01) : 299 - 311
  • [44] Remarks on minorants of Laplacians on a geometric graph
    Vladimirov, A. A.
    MATHEMATICAL NOTES, 2015, 98 (3-4) : 519 - 521
  • [45] Explainable Similarity of Datasets Using Knowledge Graph
    Skoda, Petr
    Klimek, Jakub
    Necasky, Martin
    Skopal, Tomas
    SIMILARITY SEARCH AND APPLICATIONS (SISAP 2019), 2019, 11807 : 103 - 110
  • [46] Measuring graph similarity using spectral geometry
    ElGhawalby, Hewayda
    Hancock, Edwin R.
    IMAGE ANALYSIS AND RECOGNITION, PROCEEDINGS, 2008, 5112 : 517 - 526
  • [47] Exploring attention mechanism for graph similarity learning
    Tan, Wenhui
    Gao, Xin
    Li, Yiyang
    Wen, Guangqi
    Cao, Peng
    Yang, Jinzhu
    Li, Weiping
    Zaiane, Osmar R.
    KNOWLEDGE-BASED SYSTEMS, 2023, 276
  • [48] Efficient Graph Similarity Search in External Memory
    Chen, Xiaoyang
    Huo, Hongwei
    Huan, Jun
    Vitter, Jeffrey Scott
    IEEE ACCESS, 2017, 5 : 4551 - 4560
  • [49] Graph-Based Shape Similarity of Petroglyphs
    Seidl, Markus
    Wieser, Ewald
    Zeppelzauer, Matthias
    Pinz, Axel
    Breiteneder, Christian
    COMPUTER VISION - ECCV 2014 WORKSHOPS, PT I, 2015, 8925 : 133 - 148
  • [50] Fault-tolerant detection of a quantum error
    Rosenblum, S.
    Reinhold, P.
    Mirrahimi, M.
    Jiang, Liang
    Frunzio, L.
    Schoelkopf, R. J.
    SCIENCE, 2018, 361 (6399) : 266 - 269
12345