Efficient Graph Similarity Search in External Memory
Many real-world applications, such as bioinformatics, data mining, pattern recognition, and social network analysis, benefit from efficient solutions for the graph similarity search problem. Existing methods have limited scalability when they handle the large graph databases, for example, those with...
Main Authors: | Xiaoyang Chen, Hongwei Huo, Jun Huan, Jeffrey Scott Vitter |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2017-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/7878573/ |
Similar Items
-
Fast Top-K Graph Similarity Search Via Representative Matrices
by: Zhigang Sun, et al.
Published: (2018-01-01) -
Similar Supergraph Search Based on Graph Edit Distance
by: Masataka Yamada, et al.
Published: (2021-07-01) -
A One-Size-Fits-Three Representation Learning Framework for Patient Similarity Search
by: Yefan Huang, et al.
Published: (2023-08-01) -
A Framework Similarity Estimation of Unweighted Undirected Graphs
by: Valentin Sysoev
Published: (2022-10-01) -
Associative Memories to Accelerate Approximate Nearest Neighbor Search
by: Vincent Gripon, et al.
Published: (2018-09-01)