Sciweavers

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

11

ICDIM
2008
IEEE

favoriteEmaildiscussreport

133views Information Technology» more ICDIM 2008»

A fast approximate algorithm for large-scale Latent Semantic Indexing

13 years 11 months ago

A fast approximate algorithm for large-scale Latent Semantic Indexing

Download www.dcs.bbk.ac.uk

Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining. However, the computational complexity of LSI may be prohibitively high when applied to very large datasets. In this paper, we present a fast approximate algorithm for large-scale LSI that is conceptually simple and theoretically justiﬁed. Our main contribution is to show that the proposed algorithm has provable error bound and linear computational complexity.

Dell Zhang, Zheng Zhu

Real-time Traffic

Computational Complexity | Fast Approximate Algorithm | ICDIM 2008 | Information Management | Latent Semantic Indexing |

claim paper

Related Content

» Straightforward Feature Selection for Scalable Latent Semantic Indexing

» Large Scale Web Service Discovery and Composition using High Performance InMemory Indexing

» Tensor space model for document analysis

» On the equivalence between Nonnegative Matrix Factorization and Probabilistic Latent Seman...

» Understanding and Enhancing the FoldingIn Method in Latent Semantic Indexing

» Hypergraphbased multilevel matrix approximation for text information retrieval

» Regularized locality preserving indexing via spectral regression

» SPEC Hashing Similarity Preserving algorithm for Entropybased Coding

» Scalable similarity search with optimized kernel hashing

Post Info
More Details (n/a)

Added	30 May 2010
Updated	30 May 2010
Type	Conference
Year	2008
Where	ICDIM
Authors	Dell Zhang, Zheng Zhu

Comments (0)