Efficient similarity search within user-specified projective subspaces

Michael E. Houle, Xiguo Ma, Vincent Oria, Jichao Sun

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)2-14
Number of pages13
JournalInformation Systems
StatePublished - Jul 1 2016

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture


  • Intrinsic dimensionality
  • Multi-step search
  • Subspace similarity search


Dive into the research topics of 'Efficient similarity search within user-specified projective subspaces'. Together they form a unique fingerprint.

Cite this