BIROn - Birkbeck Institutional Research Online

    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.

    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

    Downloads
    Activity Overview
    0Downloads
    164Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item