An Improved Semidiscrete Matrix Decomposition and its Application in Chinese Information Retrieval

Article Preview

Abstract:

Information retrieval is an important direction in the area of natural language processing .This paper introduced semidiscrete matrix decomposition in latent semantic indexing. We aimed at it’s disadvantage in storage space and presented SSDD,then we compare the difference of SVD and SDD and SSDD in performance

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3121-3124

Citation:

Online since:

December 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Thomas K. Landauer .Susan T. Dumais. The Latent Semantic Analysis Theory of Acquisition, Induction and Representation of Knowledge.

Google Scholar

[2] Gai Jie,Wang Yi,Wu Gang Shan:Text Information Retrieval Based on Latent Semantic Analysis[J]. Computer Engineering.Vol.30,No 2,January 2004.In Chinese.

Google Scholar

[3] Tamara G.. Kolda. Dianne P. O'leary. A semidiscrete Matrix Decomposition for Latent Semantic Indexing In Information Retrieval. ACM Transactions on Information systems,Vol.16,No.4,October 1998.

DOI: 10.1145/291128.291131

Google Scholar

[4] Kolda, T. G. and O'Leary, D. P. 1997. Latent semantic indexing via a semi-discrete matrix decomposition. In The Mathematics of Information Coding, Extraction and Distribution, G. Cybenko, D. P. O'Leary, and J. Rissanen, Eds. IMA Volumes in Mathematics and Its Applications. Springer-Verlag. To appear. Also available as University of Maryland Department of Computer Science Technical Report CS-TR-3717. http://www.cs.umd.edu/Dienst/UI/ 2.0/Describe/ncstrl.umcp/CS-TR-3713.

DOI: 10.1007/978-1-4612-1524-0_5

Google Scholar

[5] Tamara G.. Kolda. Dianne P. O'leary. Computation and Uses of the Semidiscrete Matrix Decomposition . ACM Transactions on Mathematical software,Vol.26,No.3, September 2000.

DOI: 10.1145/358407.358424

Google Scholar