Dimensionality reduction and similarity computation by inner-product approximations
نویسندگان
چکیده
منابع مشابه
Dynamic Dimensionality Reduction and Similarity Distance Computation by Inner Product Approximations
Developing efficient ways for dimensionality reduction is crucial for the query performance in multimedia databases. For approximation queries a careful analysis must be performed on the approximation quality of the dimensionality reduction technique. Besides having the lower-bound property, we expect the techniques to have good quality of distance measures when the similarity distance between ...
متن کاملDimensionality Reduction by Random Mapping: Fast Similarity Computation for Clustering
When the data vectors are high dimensional it is com putationally infeasible to use data analysis or pattern recognition algorithms which repeatedly compute simi larities or distances in the original data space It is therefore necessary to reduce the dimensionality before for example clustering the data If the dimensionality is very high like in the WEBSOM method which orga nizes textual docume...
متن کاملDimensionality Reduction with Simultaneous Sparse Approximations
We propose a dimensionality reduction method for structured signals and its application in classification. The training phase implements a learning process that forms a parts-based representation of signals. Signals are jointly represented in a common subspace extracted from a redundant dictionary of basis functions, using greedy pursuit algorithms for simultaneous sparse approximations. A smal...
متن کاملDimensionality Reduction using Similarity-induced Embeddings
The vast majority of dimensionality reduction (DR) techniques rely on the second-order statistics to define their optimization objective. Even though this provides adequate results in most cases, it comes with several shortcomings. The methods require carefully designed regularizers and they are usually prone to outliers. In this paper, a new DR framework that can directly model the target dist...
متن کاملInner Product Similarity Search using Compositional Codes
This paper addresses the nearest neighbor search problem under inner product similarity and introduces a compact code-based approach. The idea is to approximate a vector using the composition of several elements selected from a source dictionary and to represent this vector by a short code composed of the indices of the selected elements. The inner product between a query vector and a database ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2004
ISSN: 1041-4347
DOI: 10.1109/tkde.2004.9