Fast Top-K Graph Similarity Search Via Representative Matrices

Graph similarity search is a crucial problem in many applications, such as cheminformatics, data mining, and pattern recognition. Top-k graph similarity search aims to find the most similar k graphs to a query graph in graph databases. In this paper, we present a fast top-k graph similarity search a...

Descripció completa

Dades bibliogràfiques

Autors principals:	Zhigang Sun, Hongwei Huo, Xiaoyang Chen
Format:	Artigo
Idioma:	Inglês
Publicat:	IEEE 2018-01-01
Col·lecció:	IEEE Access
Matèries:	Graph similarity search top-k representative matrix
Accés en línia:	https://ieeexplore.ieee.org/document/8325543/
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!