.png){kind=icon}
.png){kind=icon}
Return
Efficient similarity search within user-specified projective subspaces
.png){kind=icon}
OA
AI
DOI：10.1016/j.is.2016.01.008.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many applications - such as content-based image retrieval, subspace clustering, and feature selection - may benefit from efficient subspace similarity search. Given a query object, the goal of subspace similarity search is to retrieve the most similar objects from the database, where the similarity distance is defined over an arbitrary subset of dimensions (or features) - that is, an arbitrary axis-aligned projective subspace - specified along with the query. Though much effort has been spent on similarity search in fixed subspaces, relatively little attention has been given to the problem of similarity search when the dimensions are specified at query time. In this paper, we propose new methods for the subspace similarity search problem for real-valued data. Extensive experiments are provided showing very competitive performance relative to state-of-the-art solutions. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Subspace similarity search
Multi-step search
Intrinsic dimensionality
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.9
Papers:
2.8K
Citations:
1.8K
View more organizations