Abstract
This paper proposes a new feature selection algorithm. First, the data at every attribute are sorted. The continuously distributed data with the same class labels are grouped into runs. The runs whose length is greater than a given threshold are selected as “valid” runs, which enclose the instances separable from the other classes. Second, we count how many runs cover every instance and check how the covering number changes once eliminate a feature. Then, we delete the feature that has the least impact on the covering cases for all instances. We compare our method with ReliefF and a method based on mutual information. Evaluation was performed on 3 image databases. Experimental results show that the proposed method outperformed the other two.
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
Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. Journal of Machine Learning Research 3, 1157–1182 (2003)
Liu, H., Yu, L.: Toward integrating feature selection algorithms for classification and clustering. IEEE Trans. Knowledge and Data Engineering 17, 491–502 (2005)
Jain, A., Zongker, D.: Feature selection: Evaluation, application, and small sample performance. IEEE Transactions on Pattern Analysis and Machine Intelligence 19, 153–158 (1997)
Kohavi, R., John, G.H.: Wrappers for feature subset selection. Artificial Intelligence 97, 273–324 (1997)
Robnik-Sikonja, M., Kononenko, I.: Theoretical and empirical analysis of ReliefF and RreliefF. Machine Learning 53, 23–69 (2003)
Kira, K., Rendell, L.: A practical approach to feature selection. In: Proc. Int. Conf. Machine Learning, pp. 249–256 (1992)
Peng, H., Long, F., Ding, C.: Feature selection based on mutual information: Criteria of max-dependency, max-relevance, and min-redundancy. IEEE Transactions on Pattern Analysis and Machine Intelligence 27, 1226–1238 (2005)
Kohavi, R.: A study of cross-validation and bootstrap for accuracy estimation and model selection. In: Proc. Int. Joint Conf. Artificial Intelligence, pp. 1137–1145 (1995)
Rui, Y., Huang, T.S., Chang, S.: Image retrieval: Current techniques, promising directions and open issues. Visual communication and image representation 10(4), 39–62 (1999)
Ho, T.K., Baird, H.S.: Pattern classification with compact distribution maps. Computer Vision and Image Understanding 70, 101–110 (1998)
Cover, T.M.: The best two independent measurements are not the two best. IEEE Transactions on Systems, Man, and Cybernetics 4, 116–117 (1974)
Narendra, P.M., Fukunaga, K.: A branch and bound algorithm for feature subset selection. IEEE Transactions on Computers 26, 917–922 (1977)
Somol, P., Pudil, P., Kittler, J.: Fast branch & bound algorithms for optimal feature selection. IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 900–912 (2004)
Kwak, N., Choi, C.H.: Input feature selection by mutual information based on Parzen windows. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(12), 1667–1671 (2002)
Trappenberg, T., Ouyang, J., Back, A.: Input variable selection: Mutual information and linear mixing measures. IEEE Trans. Knowledge and Data Engineering 18, 37–46 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, S., Liang, J., Wang, Y., Winstanley, A. (2006). Feature Selection Based on Run Covering. In: Chang, LW., Lie, WN. (eds) Advances in Image and Video Technology. PSIVT 2006. Lecture Notes in Computer Science, vol 4319. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11949534_21
Download citation
DOI: https://doi.org/10.1007/11949534_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68297-4
Online ISBN: 978-3-540-68298-1
eBook Packages: Computer ScienceComputer Science (R0)