Features and protypes selection are two major problems in data mining, especially for machine learning algorithms. The goal of both selections is to reduce storage complexity, and thus computational costs, without sacrificing accuracy. In this article, we present two incremental algorithms using geometrical neighborhood graphs and a new statistical test to select, step by step, relevant features and prototypes for supervised learning problems. The feature selection procedure we present could be applied before any machine learning algorithm is used.
CITATION STYLE
Sebban, M., Zighed, D. A., & Di Palma, S. (1999). Selection and statistical validation of features and prototypes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1704, pp. 184–192). Springer Verlag. https://doi.org/10.1007/978-3-540-48247-5_20
Mendeley helps you to discover research relevant for your work.