Abstract
Feature selection is one of important and frequently used techniques in data preprocessing. It can improve the efficiency and the effectiveness of data mining by reducing the dimensions of feature space and removing the irrelevant and redundant information. Feature selection can be viewed as a global optimization problem of finding a minimum set of M relevant features that describes the dataset as well as the original N attributes. In this paper, we apply the adaptive partitioned random search strategy into our feature selection algorithm. Under this search strategy, the partition structure and evaluation function is proposed for feature selection problem. This algorithm ensures the global optimal solution in theory and avoids complete randomness in search direction. The good property of our algorithm is shown through the theoretical analysis.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Almuallim, H., Dietterich, T.G.: Learning with Many Irrelevant Features. In: Proceedings of the Ninth National Conference on Artificial Intelligence, pp. 547–552 (1992)
Ben-Bassat, M.: Pattern Recognition and Reduction of Dimensionality. In: Krishnaiah, P.R., Kanal, L.N. (eds.) Handbook of Statistics-II, pp. 773–791. North-Holland, Amsterdam (1982)
Blum, A.L., Langley, P.: Selection of relevant features and example in machine learning. Artificial Intelligence 97, 245–271 (1997)
Blum, A.L., Rivest, R.L.: Training a 3-node Neural Networks in NP-complete. Neural Networks 5, 117–127 (1992)
Caruana, R., Freitag, D.: Greedy Attribute Selection. In: Proceedings of the Eleventh International Conference on Machine Learning, pp. 153–172 (2002)
Dash, M., Choi, K., Scheuermannm, P., Liu, H.: Feature Selection for Clustering-a Filter Solution. In: Proceedings of the 2nd International Conference on Data Mining, pp. 115–122 (2002)
Doak, J.: An Evaluation of Feature Selection Methods and Their Application to Computer Security,Technical report, University of California, Department of Computer Science (1992)
Dy, J.G., Brodley, C.E.: Feature Subset Selection and Order Identification for Unsupervised Learning. In: Proceedings of the Seventeenth International Conference on Machine Learning, pp. 247–254 (2000)
Hall, M.A.: Correlation-based Feature Selection for Discrete and Numeric Class Machine Learning. In: Proceedings of the Seventeenth International Conference on Machine learning, pp. 359–366 (2000)
Kerber, R., Livezy, B., Simoudis, E.: A hybrid System for Data Mining. In: Goonatilake, S., Khebbal, S. (eds.) Intelligent Hybrid Systems. John Wiley, Chichester (1995)
Kim, Y., Street, W., Menczer, F.: Feature Selection for Unsupervised Learning via Evolutionary Search. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 365–369 (2000)
Kohavi, R., John, G.H.: Wrappers for Feature Subset Selection. Artificial Intelligence 97(1-2), 273–324 (1997)
Langley, P.: Selection of Relevant Features in Machine Learning. In: Proceedings of the AAAI Fall Symposium on Relevance, pp. 140–144. AAAI Press, Menlo Park (1994)
Liu, H., Motoda, H.: Feature Extraction, Construction and Selection: a Data Mining Perspective. Kluwer academic publishers, Boston (1998)
Liu, H., Motoda, H.: Feature Selection for Knowledge Discovery and Data Mining. Kluwer Academic Publishers, Boston (1998)
Liu, H., Setiono, R.: A Probabilistic Approach to Feature Selection- a Filter Solution. In: Proceedings of the 13th International Conference on Machine Learning, pp. 319–327 (1996)
Liu, H., Yu, L.: Toward Integrating Future Selection Algorithms for Classification and Clustering. IEEE Trans. on Knowledge and Data Engineering 17(3), 1–12 (2005)
Molina, L.C., Belanche, L., Nebot, A.: Feature Selection Algorithms: A Survey and Experimental Evaluation. In: Proceedings of IEEE International Conference on Data Mining, pp. 306–313 (2002)
Narendra, P.M., Fukunaga, K.: A Branch and Bound Algorithm for Feature Selection Subset Selection. IEEE Trans. On Computing C-26(9), 917–922 (1977)
Shi, L.Y., Olasfsson, S.: Nested Partitions Method for Global Optimization. Operation research 48(3), 390–407 (2000)
Tang, Z.B.: Adaptive Partitioned Random Search to Global Optimization. IEEE Trans. On Automatic Control 39(11), 2235–2244 (1994)
Yu, L., Liu, H.: Feature Selection for High Dimensional Data: a Fast Correlation-based Filter Solution. In: Proceedings of the Twentieth International Conference on Machine Learning, pp. 856–863 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, X., Wang, H., Xu, D. (2005). The Application of Adaptive Partitioned Random Search in Feature Selection Problem. In: Li, X., Wang, S., Dong, Z.Y. (eds) Advanced Data Mining and Applications. ADMA 2005. Lecture Notes in Computer Science(), vol 3584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527503_37
Download citation
DOI: https://doi.org/10.1007/11527503_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27894-8
Online ISBN: 978-3-540-31877-4
eBook Packages: Computer ScienceComputer Science (R0)