Random Manhattan Indexing
Authors:
- Behrang Q. ZadehBZBehrang Q. Zadeh
- Siegfried HandschuhSHSiegfried Handschuh
Open Access
- 1 September 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15294188,p. 203-208
Abstract
Vector space models (VSMs) are mathematically well-defined frameworks that have been widely used in text processing. In these models, high-dimensional, often sparse vectors represent text units. In an application, the similarity of vectors -- and hence the text units that they represent -- is computed by a distance formula. The high dimensionality of vectors, however, is a barrier to the performance of methods that employ VSMs. Consequently, a dimensionality reduction technique is employed to alleviate this problem. This paper introduces a new method, called Random Manhattan Indexing (RMI), for the construction of L1 normed VSMs at reduced dimensionality. RMI combines the construction of a VSM and dimension reduction into an incremental, and thus scalable, procedure. In order to attain its goal, RMI employs the sparse Cauchy random projections.Keywords
This publication has 16 references indexed in Scilit:
- Reflective Random Indexing and indirect inference: A scalable method for discovery of implicit connectionsJournal of Biomedical Informatics, 2009
- Principal Component Analysis Based on L1-Norm MaximizationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2008
- Very sparse stable random projections for dimension reduction inlα (0 <α ≤ 2) norm2007
- Very sparse random projections2006
- On the impossibility of dimension reduction in l 1Journal of the ACM, 2005
- An elementary proof of a theorem of Johnson and LindenstraussRandom Structures & Algorithms, 2002
- Stable distributions, pseudorandom generators, embeddings and data stream computation2002
- Database-friendly random projections2001
- Extensions of Lipschitz mappings into a Hilbert space1984
- A vector space model for automatic indexingCommunications of the ACM, 1975