Abstract
In mining large, high-dimensional sparse featured datasets, it is important to reduce the dimensionality for efficient processing. Some methods of reducing the features include conventional feature selection and extraction methods, frequent item support-based methods, and optimal feature selection approaches. In earlier chapters, we discussed feature selection based on frequent items. In the present chapter, we combine a nonlossy compression scheme with genetic algorithm-based feature selection in arriving at a scheme that results in efficient feature selection. In the process, we provide an overview of methods of feature selection, feature extraction, genetic algorithms, etc. We implement the proposed scheme of efficient optimal prototype selection using genetic algorithms that combines compressed data classification performance as a fitness function. We demonstrate working of the scheme by implementing it on a large dataset bringing out insights, and sensitivity of genetic operators is shown as a movement of cloud of solution space as the parameters vary. We provide notes on relevant literature and a list of references at the end of the chapter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
H. Cheng, X. Yan, J. Han, C.-W. Hsu, Discriminative frequent pattern analysis for effective classification, in 23rd Intl. Conf. for Data Engineering (2007), pp. 525–716
T.M. Cover, J.M. Van Camenhout, On the possible orderings in the measurement selection problem. IEEE Trans. Syst. Man Cybern. 7(9), 657–661 (1977)
L.D. Davis, M. Mitchell, Handbook of Genetic Algorithms (Van Nostrand Reinhold, New York, 1991)
R.O. Duda, P.E. Hart, D.G. Stork, Pattern Classification (Wiley, New York, 2001)
D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning (Addison-Wesley, Reading, 1989)
D. Greenhagh, S. Marshall, Convergence criteria for genetic algorithms. SIAM J. Comput. 3(1), 269–282 (2000)
C.-M. Hsu, M.-S. Chen, On the design and applicability of distance functions in high-dimensional data space. IEEE Trans. Knowl. Data Eng. 21, 523–536 (2009)
I.T. Jolliffe, Principal Component Analysis (Springer, New York, 1986)
Y. Kimura, A. Suzuki, K. Odaka, Feature selection for character recognition using genetic algorithm, in Fourth Intl. Conf. on Innovative Computing, Information and Control (ICICIC) (2009), pp. 401–404
D.D. Lee, H. Seung, Learning the parts of objects by non-negative matrix factorization. Nature 401, 788–791 (1999)
K.F. Man, K.S. Tang, S. Kwong, Genetic algorithms: concepts. IEEE Trans. Ind. Electron. 43(5), 519–534 (1996)
A.K. Menon, Random projections and applications to dimensionality reduction. B.Sc. (Hons.) Thesis, School of Info. Technologies, University of Sydney, Australia (2007)
L.S. Oliveira, N. Benahmed, R. Sabourin, F. Bortolozzi, C.Y. Suen, Feature subset selection using genetic algorithms for handwritten digit recognition, in Computer Graphics and Image Processing (2001), pp. 362–369
P. Pudil, J. Novovicova, J. Kittler, Floating search methods in feature selection. Pattern Recognit. Lett. 15, 1119–1125 (1994)
W.F. Punch, E.D. Goodman, M. Pei, L.C. Shun, P. Hovland, R. Enbody, Further research on feature selection and classification using genetic algorithms, in ICGA (1993), pp. 557–564
C. Punya Murthy, M. Narasimha Murty, Discriminative feature selection for document classification, in Proceedings of ICONIP (2012)
T. Ravindra Babu, M. Narasimha Murty, V.K. Agrawal, On simultaneous selection of prototypes and features in large data pattern recognition, in LNCS, vol. 3776 (Springer, Berlin, 2005), pp. 595–600
T. Ravindra Babu, M. Narasimha Murty, Comparison of genetic algorithm based prototype selection schemes. Pattern Recognit. 34(2), 523–525 (2001)
T. Ravindra Babu, M. Narasimha Murty, V.K. Agrawal, Classification of run-length encoded binary data. Pattern Recognit. 40(1), 321–323 (2007)
M.L. Raymer, W.F. Punch, E.D. Goodman, P.C. Sanschagrin, L.A. Kuhn, Simultaneous feature extraction and selection using a masking genetic algorithm, in Proc. 7th Intl. Conf. on Genetic Algorithms (1997)
M.L. Raymer, W.F. Punch, E.D. Goodman, L.A. Kuhn, A.K. Jain, Dimensionality reduction using genetic algorithms. IEEE Trans. Evol. Comput. 4(2), 164–171 (2000)
W. Siedlecki, J. Sklansky, A note on genetic algorithms for large-scale feature selection. Pattern Recognit. Lett. 10, 335–347 (1989)
P. Somol, P. Pudil, J. Novovicova, P. Paclik, Adaptive floating search methods in feature selection. Pattern Recognit. Lett. 20, 1157–1163 (1999)
J. Yang, V. Honavar, Feature subset selection using a genetic algorithm. Intell. Syst. Appl. 13(2), 44–49 (1998)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Ravindra Babu, T., Narasimha Murty, M., Subrahmanya, S.V. (2013). Optimal Dimensionality Reduction. In: Compression Schemes for Mining Large Datasets. Advances in Computer Vision and Pattern Recognition. Springer, London. https://doi.org/10.1007/978-1-4471-5607-9_7
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5607-9_7
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5606-2
Online ISBN: 978-1-4471-5607-9
eBook Packages: Computer ScienceComputer Science (R0)