Dimensionality reduction through sub-space mapping for nearest neighbour algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1810, Issue , 2000, Pages 331-343

  Payne, Terry R ^a   Edwards, Peter ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF ABERDEEN   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DIMENSIONALITY REDUCTION; LEARNING SYSTEMS; MONTE CARLO METHODS; SUPERVISED LEARNING;

CLASSIFICATION ACCURACY; EMPIRICAL EVALUATIONS; FILTER APPROACH; INFORMATION GAIN; LEARNING TASKS; NEAREST NEIGHBOUR; SUB-SPACES;

LEARNING ALGORITHMS;

EID: 84974712013     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45164-1_35     Document Type: Conference Paper

References (19)

1. D. W. Aha. Tolerating Noisy, Irrelevant and Novel Attributes in Instance-Based Learning Algorithms. International Journal of Man-Machine Studies, 36:267-287, 1992. 332
2. H. Almuallim and T. G. Dietterich. Learning With Many Irrelevant Features. In Proceedings of the 9th National Conference on Artificial Intelligence (AAAI-91), pages 547-552. MIT Press, 1991. 336
3. M. W. Berry and R. D. Fierro. Low-Rank Orthogonal Decompositions for Information Retrieval Applications. Numerical Linear Algebra with Applications, 1(1):1-27, 1996. 334
4. C. L. Blake and C. J. Merz. UCI repository of machine learning databases, 1998. 333, 336
5. C. Cardie. Using Decision Trees to Improve Case-Based Learning. In Proceedings of the 10th International Conference on Machine Learning, pages 25-32. San Francisco, CA:Morgan Kaufmann, 1993. 336
6. B. V. Dasarathy. Nearest Neighbor(NN) Norms: NN Pattern Classification Techniques. Los Alamitos, California:IEEE Computer Society Press, 1991. 335
7. S. Deerwester, S. T. Dumais, G. W. Furnas, T. K. Landauer, and R. Harshman. Indexing by Latent Semantic Analysis. Journal of the American Society for Information Science, 41(6):391-407, 1990. 333, 341
8. R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. John Wiley and Sons, 1973. 337
9. M. J. Greenacre. Theory and Applications of Correspondence Analysis. London, UK:Academic Press, 1984. 332, 333, 334
10. G. John, R. Kohavi, and K. Pfleger. Irrelevant Features and the Subset Selection Problem. In Proceedings of the 11th International Conference on Machine Learning, pages 121-129. San Francisco, CA:Morgan Kaufmann, 1994. 332
11. P. Langley and W. Iba. Average-case Analysis of a Nearest Neighbor Algorithm. In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI), pages 889-894. San Mateo, CA:Morgan Kaufmann, 1993. 332
12. P. Langley and S. Sage. Induction of Selective Bayesian Classifiers. In Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence, pages 399-406. Seattle, WA:Morgan Kaufmann, 1994. 332
13. H. Liu and R. Setiono. A Probabilistic Approach to Feature Selection - A Filter Solution. In Proceedings of the 13th International Conference on Machine Learning, pages 319-327. San Francisco, CA:Morgan Kaufmann, 1996. 335, 336
14. T. R. Payne. Dimensionality Reduction and Representation for Nearest Neighbour Learning. PhD thesis, The University of Aberdeen, Scotland, 1999. 332, 333, 334, 335
15. T. R. Payne and P. Edwards. Dimensionality Reduction through Correspondence Analysis. Technical Report AUCS/TR9910, Department of Computing Science, University of Aberdeen, Scotland., 1999. 333, 334
16. W. H. Press. Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, 1992. 334
17. J. R. Quinlan. C4.5 Programs for Machine Learning. San Mateo, CA:Morgan Kaufmann, 1993. 336
18. G. Salton and M. J. McGill. Introduction to Modern Information Retrieval. New York: McGraw-Hill, 1983. 333
19. C. Wu, M. Berry, S. Shivakumar, and J. McLarty. Neural Networks for Full-Scale Protein Sequence Classification: Sequence Encoding with Singular Value Decomposition. Machine Learning, 21:177-193, 1995. 333