Towards Representation Independent Similarity Search Over Graph Databases

Abstract

Finding similar entities is a fundamental problem in graph data analysis. Similarity search algorithms usually leverage the structural properties of the database to quantify the degree of similarity between entities. However, the same information can be represented in different structures and the structural properties observed over particular… (More)
DOI: 10.1145/2983323.2983673

Topics

4 Figures and Tables

Cite this paper

@inproceedings{Chodpathumwan2016TowardsRI, title={Towards Representation Independent Similarity Search Over Graph Databases}, author={Yodsawalai Chodpathumwan and Amirhossein Aleyasen and Arash Termehchy and Yizhou Sun}, booktitle={CIKM}, year={2016} }