Abstract
In many fields such as data mining, machine learning, pattern recognition and signal processing, data sets containing huge number of features are often involved. Feature selection is an essential data preprocessing technique for such high-dimensional data classification tasks. Traditional dimensionality reduction approach falls into two categories: Feature Extraction (FE) and Feature Selection (FS). Principal component analysis is an unsupervised linear FE method for projecting high-dimensional data into a low-dimensional space with minimum loss of information. It discovers the directions of maximal variances in the data. The Rough set approach to feature selection is used to discover the data dependencies and reduction in the number of attributes contained in a data set using the data alone, requiring no additional information. For selecting discriminative features from principal components, the Rough set theory can be applied jointly with PCA, which guarantees that the selected principal components will be the most adequate for classification. We call this method Rough PCA. The proposed method is successfully applied for choosing the principal features and then applying the Upper and Lower Approximations to find the reduced set of features from a gene expression data.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Jensen R, “Performing feature selection with ACO. Swarm intelligence and data mining”, Abraham A, Grosan C and Ramos V (eds.), Studies in Computational Intelligence, 34, 2006, 45–73.
Yan J, Zhang B, Liu N, Yan S, Cheng Q, Fan W, Yang Q, Xi W, Chen Z, “Effective and efficient dimensionality reduction for large-scale and streaming data preprocessing”, IEEE transactions on knowledge and data engineering, 18, 3, 2006, 320–333.
Davy M, Luz S, “Dimensionality reduction for active learning with nearest neighbour classifier in text categorisation problems”, Sixth International Conference on Machine Learning and Applications, 2007.
Swiniarski RW, “Rough sets methods in feature reduction and classification” International Journal of Applied Mathematics and Computer Science, 11, 3, 2001, 565–582.
Jollie IT, “Principal Component Analysis”, Springer-Verlag, New York, 1986.
Pawlak Z, “Rough Sets: Theoretical Aspects of Reasoning About Data”, Kluwer Academic Publishing, Dordrecht, 1991.
Polkowski L, Lin TY, Tsumoto S (Eds), “Rough set methods and applications: new developments in knowledge discovery in information systems”, Vol. 56. Studies in Fuzziness and Soft Computing, Physica-Verlag, Heidelberg, 2000.
Pawlak Z, “Roughsets” International Journal of Computer and Information Sciences, 11, 1982, 341–356.
UCI Repository for Machine Learning Databases retrieved from the World Wide Web: http://www.ics.uci.edu
Han J, Kamber M, Data Mining: Concepts and Techniques, Morgan Kaufmann, 2001 279–325.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Mishra, D., Dash, R., Rath, A.K., Acharya, M. (2011). Feature Selection in Gene Expression Data Using Principal Component Analysis and Rough Set Theory. In: Arabnia, H., Tran, QN. (eds) Software Tools and Algorithms for Biological Systems. Advances in Experimental Medicine and Biology, vol 696. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7046-6_10
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7046-6_10
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-7045-9
Online ISBN: 978-1-4419-7046-6
eBook Packages: Biomedical and Life SciencesBiomedical and Life Sciences (R0)