.png){kind=icon}
.png){kind=icon}
Return
Hypergraph-based image retrieval for graph-based representation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2012.04.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we introduce a novel method for graph indexing. We propose a hypergraph-based model for graph data sets by allowing cluster overlapping. More precisely, in this representation one graph can be assigned to more than one cluster. Using the concept of the graph median and a given threshold, the proposed algorithm detects automatically the number of classes in the graph database. We consider clusters as hyperedges in our hypergraph model and we index the graph set by the hyperedge centroids. This model is interesting to traverse the data set and efficient to retrieve graphs. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Graph indexing
Graph retrieval
CBIR
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.