Dimension reduction in today’s vector space based information retrieval system is essential for improving computational efficiency in handling massive data. In our previous work we proposed a mathematical framework for lower dimensional representations of text data in vector space based information retrieval, and a couple of dimension reduction method using minimization and matrix rank reduction formula. One of our proposed methods is CentroidQR method which utilizes orthogonal transformation on centroids, and the test results showed that its classification results were exactly the same as those of classification with full dimension when a certain classification algorithm is applied. In this paper we discuss in detail the CentroidQR, and prove mathematically its classification properties with two different similarity measures of L2 and cosine. ∗The work of all three authors was supported in part by the National Science Foundation grant CCR-9901992. Dept. of Computer Science and Engineering, Univ. of Minnesota, Minneapolis, MN 55455, U.S.A., e-mail: jeon@cs.umn.edu. †Dept. of Computer Science and Engineering, Univ. of Minnesota, Minneapolis, MN 55455, U.S.A., e-mail: hpark@cs.umn.edu. ‡Dept. of Computer Science and Engineering, Univ. of Minnesota, Minneapolis, MN 55455 and Dept. of Computer Science and Engineering, Univ. of California, San Diego, La Jolla, CA 92093, U.S.A. e-mail: jbrosen@cs.ucsd.edu.
[1]
Susan T. Dumais,et al.
Using Linear Algebra for Intelligent Information Retrieval
,
1995,
SIAM Rev..
[2]
Eui-Hong,et al.
Centroid-Based Document Classifica tion : Analysis & Exper imental Results ∗
,
2000
.
[3]
J. Ben Rosen,et al.
Total Least Norm Formulation and Solution for Structured Problems
,
1996,
SIAM J. Matrix Anal. Appl..
[4]
George Karypis,et al.
Concept Indexing: A Fast Dimensionality Reduction Algorithm With Applications to Document Retrieval and Categorization
,
2000
.
[5]
T DumaisSusan,et al.
Using linear algebra for intelligent information retrieval
,
1995
.
[6]
J. Navarro-Pedreño.
Numerical Methods for Least Squares Problems
,
1996
.
[7]
Willem J. Heiser,et al.
Two Purposes for Matrix Factorization: A Historical Appraisal
,
2000,
SIAM Rev..
[8]
Gene H. Golub,et al.
Matrix Computations, Third Edition
,
1996
.
[9]
Anil K. Jain,et al.
Algorithms for Clustering Data
,
1988
.
[10]
George Karypis,et al.
Centroid-Based Document Classification: Analysis and Experimental Results
,
2000,
PKDD.
[11]
B. Ripley,et al.
Pattern Recognition
,
1968,
Nature.
[12]
Jiawei Han,et al.
Efficient and Effective Clustering Methods for Spatial Data Mining
,
1994,
VLDB.