Publication

Random Indexing Explained with High Probability

QasemiZadeh, Behrang
Thumbnail Image
Files
Thumbnail Image
tsd2015.pdf
Adobe PDF, 262.03 KB
Identifiers
http://hdl.handle.net/10379/5087
 https://doi.org/10.13025/21096
Publication Date
2015
Keywords
Random indexing, Dimensionality reduction, Natural language processing, Text analytics, Vector space models, Random projections
Type
Conference Paper
Downloads
Show all metadata
Citation
QasemiZadeh, Behrang; (2015) Random Indexing Explained with High Probability . In: Vaclav Matousek et al eds. 18th International Conference, TSD 2015 PLZEŇ, CZECH REPUBLIC,
Abstract
Random indexing (RI) is an incremental method for constructing a vector space model (VSM) with a reduced dimensionality. Previously, the method has been justified using the mathematical framework of Kanerva's sparse distributed memory. This justification, although intuitively plausible, fails to provide the information that is required to set the parameters of the method. In order to suggest criteria for the method's parameters, the RI method is revisited and described using the principles of linear algebra and sparse random projections in Euclidean spaces. These simple mathematics are then employed to suggest criteria for setting the method's parameters and to explain their influence on the estimated distances in the RI-constructed VSMs. The empirical results observed in an evaluation are reported to support the suggested guidelines in the paper.
Funder
|~|Science Foundation Ireland (SFI)|~|
Publisher
Publisher DOI
Rights
Attribution-NonCommercial-NoDerivs 3.0 Ireland
cbn
Collections
Data Science Institute (Conference Papers)