A fast approximate algorithm for large-scale Latent semantic indexing

Zhang, Dell and Zhu, Zheng (2008) A fast approximate algorithm for large-scale Latent semantic indexing. In: Pichappan, P. and Abraham, A. (eds.) 2008 Third International Conference on Digital Information Management. Piscataway, U.S.: IEEE, pp. 626-631. ISBN 9781424429165.

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1109/ICDIM.2008.4746764

Abstract

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 justified. Our main contribution is to show that the proposed algorithm has provable error bound and linear computational complexity.

Metadata

Item Type:	Book Section
Additional Information:	Third IEEE International Conference on Digital Information Management (ICDIM), November 13-16, 2008, London, UK, Proceedings
School:	Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
Research Centre:	Birkbeck Knowledge Lab
Depositing User:	Administrator
Date Deposited:	30 May 2013 08:57
Last Modified:	02 Dec 2016 13:26
URI:	http://eprints.bbk.ac.uk/id/eprint/7079

Statistics

Archive Staff Only (login required)

Edit/View Item