Top-k Graph Similarity Search Based on Hierarchical Inverted Index

2021 11th International Conference on Information Science and Technology (ICIST)（2021）

引用 0|浏览4

暂无评分

摘要

Graph similarity search is an important research problem in many applications, such as finding result graphs that have a similar structure to a given entity in biochemistry, data mining, and pattern recognition. Top-k graph similarity search is one of graph similarity search tasks, which aims to find the top-k graphs that are most similar to the query graph in a given graph database. In this paper...

查看译文

关键词

Information science,Databases,Scalability,Filtering algorithms,Search problems,Partitioning algorithms,Indexes

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要