Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

23

NLDB
2015
Springer

favoriteEmaildiscussreport

28views Natural Language Processing» more NLDB 2015»

Random Indexing Revisited

8 years 5 days ago

Random Indexing Revisited

Download www.pars.ie

Random indexing is a method for constructing vector spaces at a reduced dimensionality. Previously, the method has been proposed using Kanerva’s sparse distributed memory model. Although intuitively plausible, this description fails to provide mathematical justiﬁcation for setting the method’s parameters. The random indexing method is revisited using the principles of sparse random projections in Euclidean spaces in order to complement its previous delineation.

Behrang QasemiZadeh

Real-time Traffic

Natural Language Processing | NLDB 2015 |

claim paper

Related Content

» Random sampling from a search engines index

» Random noncupping revisited

» Random Indexing Ktree

» The Random Oracle Methodology Revisited

» Using Random Indexing to improve Singular Value Decomposition for Latent Semantic Analysis

» TTree or BTree Main Memory Database Index Structure Revisited

» Cycling in ecological networks Finns index revisited

» Revisiting Globally Sorted Indexes for Efficient Document Retrieval

» Indexing Mobile Objects on the Plane Revisited

» Random Indexing using Statistical Weight Functions

Post Info
More Details (n/a)

Added	15 Apr 2016
Updated	15 Apr 2016
Type	Journal
Year	2015
Where	NLDB
Authors	Behrang QasemiZadeh

Comments (0)