Abstract
Feature selection is called wrapper whenever the classification algorithm is used in the selection procedure. Our approach makes use of linear classifiers wrapped into a genetic algorithm. As a proof of concept we check its performance against the UCI spam filtering problem showing that the wrapping of linear neural networks is the best. However, making sense of data involves not only selecting input features but also output features. Generally, this is considered too much of a human task to be addressed by computers. Only a few algorithms, such as association rules, allow the output to change. One of the advantages of our approach is that it can be easily generalized to search for outputs and relevant inputs at the same time. This is addressed at the end of the paper and it is currently being investigated.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kittler, J.: Feature set search algorithms. In: Chen, C. H. (ed.): Pattern recognition and signal processing. The Netherlands: Sijthoff an Noordhoff (1978).
John, G.H. Enhancements to the data mining process. PhD Dissertation, Computer Science Department, Stanford University (1997).
Hoerl, A. E., Kennard, R.: Ridge regression: biased estimation for non-orthogonal problems. Technometrics 12 (1970) 55–67.
Weigend, A. S., Rumelhart, D. E., Huberman, B. A.: Generalization by weightelimination with application to forecasting. In: Lippman, R. P., Moody, J. E., Touretzky, D. S. (eds.): Advances in Neural Information Processing Systems, Vol. 3. Morgan Kaufmann, San Mateo, CA (1991) 875–882.
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A. I.: Fast discovery of association rules. Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press, Cambridge, MA (1995).
Resnick, P., Varian, H.: Recommender systems. Communications of the ACM 40(3) (1997) 56–58.
Blake, C. L., Merz, C. J.: UCI Repository of machine learning databases [http://www.ics.uci.edu/~mlearn/MLRepository.html]. Irvine, CA: University of California, Department of Information and Computer Science (1998).
Cherkassky, V., Mulier, F.: Learning From Data: Concepts, Theory and Methods. John Wiley & Sons, New York (1998).
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA(1989).
Sierra, A., Macías, J. A., Corbacho, F.: Evolution of Functional Link Networks. IEEE Transactions on Evolutionary Computation 5(1) (2001) 54–65.
Sierra, A.: High order Fisher’s discriminant analysis. Pattern Recognition 35(6) (2002) 1291–1302.
Stearns, S. C., Hoekstra, R. F.: Evolution: an introduction. Oxford University Press, Oxford (2000).
Fisher, R. A.: The use of multiple measurements in taxonomic problems. Annals of Eugenics 7 (1936) 179–188.
Pao, Y. H., Park, G. H., Sobajic, D. J.: Learning and generalization characteristics of the random vector functional link net. Neurocomputing 6 (1994) 163–180.
Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning. Data Mining, Inference and Prediction. Springer Series in Statistics, Springer, New York (2001).
Cranor, Lorrie F., LaMacchia, Brian A.: Spam! Communications of the ACM 41(8) (1998) 74–83.
Langley, P., Sage, S.: Induction of selective Bayesian classifiers. In: de Mántaras, R. L., Poole, D. (eds.): Proc. Tenth Conference on Uncertainty in Artificial Intelligence, Seattle, WA. Morgan Kaufmann, San Francisco, CA (1994) 399-406.
Mahfoud, S. W.: Niching methods. In: Back, T., Fogel, D. B., Michalewicz, Z. (eds.): Evolutionary Computation 2. Institute of Physics Publishing, Bristol (2000) 87–92.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sierra, A., Corbacho, F. (2002). Input and Output Feature Selection. In: Dorronsoro, J.R. (eds) Artificial Neural Networks — ICANN 2002. ICANN 2002. Lecture Notes in Computer Science, vol 2415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46084-5_102
Download citation
DOI: https://doi.org/10.1007/3-540-46084-5_102
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44074-1
Online ISBN: 978-3-540-46084-8
eBook Packages: Springer Book Archive