Linear and non-linear dimensional reduction via class representatives for text classification

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 1172-1177

  Zeimpekis, Dimitrios ^a   Gallopoulos, Efstratios ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

KERNEL TECHNIQUES; MATRIX APPROXIMATION; NUMEROUS CLASSIFICATION; TEXT CLASSIFICATION TOOLS;

APPROXIMATION THEORY; CLASSIFICATION (OF INFORMATION); COST EFFECTIVENESS; DATA REDUCTION; FEATURE EXTRACTION; MATRIX ALGEBRA;

TEXT PROCESSING;

EID: 70349310852     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.98     Document Type: Conference Paper

References (29)

1. D. Achlioptas and F. McSherry. Fast computation of low rank matrix approximations. In In Proc. 33rd Annual ACM STOC, pp. 611-618, 2001.
2. M. W. Berry, S. A. Pulatova, and G. W. Stewart. Algorithm 844: Computing sparse reduced-rank approximations to sparse matrices. ACM Trans. Math. Softw., 31(2):252-269, 2005.
3. V. Castelli, A. Thomasian, and C.-S. Li. CSVD: Clustering and singular value decomposition for approximate similarity search in high-dimensional spaces. IEEE Trans. Knowledge and Data Engin., 15(3):671-685, 2003.
4. N. Cristianini and J. Shawe-Taylor. An Introduction to Support Vector Machines. Cambridge University Press, 2000.
5. N. Cristianini, J. Shawe-Taylor, and H. Lodhi. Latent semantic kernels. In C. Brodley and A. Danyluk, editors, Proc. 18th ICMLA, pp. 66-73. Morgan Kaufmann, San Francisco, 2001.
6. I. S. Dhillon and D. S. Modha. Concept decompositions for large sparse text data using clustering. Machine Learning, 42(1):143-175, Jan 2001.
7. P. Drineas, R. Kannan, and M. Mahoney. Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition. Technical Report, TR-1270, Computer Science Dept, Yale Univ., February 2004.
8. J. Gao and J. Zhang. Clustered SVD strategies in latent semantic indexing. Information Processing and Management, 431:10511063, 2005.
9. G. Golub and C. Van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, 3d edition, 1996.
10. D. Hull. Information retrieval using statistical classification. PhD thesis, Dept. Statistics, Stanford University, Palo Alto, Nov. 1994.
11. D. Hull. Improving text retrieval for the routing problem using latent semantic indexing. In Proc. 17th ACM SIGIR, pages 282-291, New York, NY, USA, 1994. Springer-Verlag New York, Inc.
12. H. Kargupta, W. Huang, K. Sivakumar, and E. Johnson. Distributed clustering using collective principal component analysis. Knowledge and Information Systems, 3(4):422-448, 2001.
13. D. Littau and D. Boley. Clustering very large data sets with principal direction divisive partitioning. In J. Kogan, C. Nicholas, and M. Teboulle, editors, Grouping Multidimensional Data: Recent Advances in Clustering, pp. 99-126. Springer, Berlin, 2006.
14. T. Liu, Z. Chen, B. Zhang, W. Ma, and G. Wu. Improving text classification using local latent semantic indexing. In Proc. ICDM'04, pp. 162-169, Washington, 2004. IEEE Computer Society.
15. C. Park and H. Park. Nonlinear feature extraction based on centroids and kernel functions. Pattern Recognition, 37(4):801-810, 2004.
16. H. Park, M. Jeon, and J. Rosen. Lower dimensional representation of text data based on centroids and least squares. BIT, 43(2):427-448, 2003.
17. Y. Qu, G. Ostrouchov, N. F. Samatova, and A. Geist. Principal component analysis for dimension reduction in massive distributed data sets. In Workshop on High Performance Data Mining held with 2nd SIAM Int'l. Conf. Data Mining, pp. 4-9, 2002.
18. H. Schütze, D. Hull, and J. Pedersen. A comparison of classifiers and document representations for the routing problem. In Proc. 18th ACM SIGIR, pp. 229-237. New York, 1995.
19. F. Sebastiani. Machine learning in automated text categorization. ACM Comput. Surveys, 34(1):1-47, 2002.
20. M.-W. Wang and J.-Y. Nie. A latent semantic structure model for text classification. In Workshop on Mathematical/Formal Methods in IR (MFIR), held during ACM-SIGIR'03, 2003.
21. E. Wiener, J. Pedersen, and A. Weigend. A neural network approach to topic spotting. In Proc. SDAIR-95, 4th Annual Symposium on Document Analysis and Information Retrieval, pp. 317-332, Las Vegas, US, 1995.
22. Y. Yang. Noise reduction in a statistical approach to text categorization. In Proc. 18th ACM SIGIR, pp. 256-263, New York, 1995.
23. Y. Yang. A study of thresholding strategies for text categorization. In Proc. 24th ACM SIGIR, pp. 137-145, New York, 2001.
24. Y. Yang and C. Chute. A linear least squares fit mapping method for information retrieval from natural language texts. In Proc. 14th Conf. Computational Linguistics, pp. 447-453, Morristown, NJ, USA, 1992. Association for Computational Linguistics.
25. Y. Yang and X. Liu. A re-examination of text categorization methods. In Proc. 22nd ACM SIGIR, pp. 42-49, New York, 1999. ACM Press.
26. Y. Yang, J. Zhang, and B. Kisiel. A scalability analysis of classifiers in text categorization. In Proc. SIGIR '03, pp. 96-103, New York, 2003.
27. D. Zeimpekis and E. Gallopoulos. CLSI: A flexible approximation scheme from clustered term-document matrices. In Proc. 5th SIAM Int'l. Conf. Data Mining, pp. 631-635, Newport Beach, California, 2005.
28. D. Zeimpekis and E. Gallopoulos. TMG: A MATLAB toolbox for generating term-document matrices from text collections. In J. Kogan, C. Nicholas, and M. Teboulle, editors, Grouping Multidimensional Data: Recent Advances in Clustering, pp. 187-210. Springer, Berlin, 2006.
29. S. Zelikovitz and H. Hirsh. Using LSI for text classification in the presence of background text. In Proc. CIKM '01, pages 113-118, New York, 2001. ACM Press.