Authors
Luke Mathieson, Alexandre Mendes, John Marsden, Jeffrey Pond, Pablo Moscato
Publication date
2017
Journal
Bioinformatics: Volume II: Structure, Function, and Applications
Pages
299-325
Publisher
Springer New York
Description
This chapter introduces a new method for knowledge extraction from databases for the purpose of finding a discriminative set of features that is also a robust set for within-class classification. Our method is generic and we introduce it here in the field of breast cancer diagnosis from digital mammography data. The mathematical formalism is based on a generalization of the k-Feature Set problem called (α, β)-k-Feature Set problem, introduced by Cotta and Moscato (J Comput Syst Sci 67(4):686–690, 2003). This method proceeds in two steps: first, an optimal (α, β)-k-feature set of minimum cardinality is identified and then, a set of classification rules using these features is obtained. We obtain the (α, β)-k-feature set in two phases; first a series of extremely powerful reduction techniques, which do not lose the optimal solution, are employed; and second, a metaheuristic search to identify the remaining features to …
Total citations
20182019202020212022202320241111
Scholar articles
L Mathieson, A Mendes, J Marsden, J Pond, P Moscato - Bioinformatics: Volume II: Structure, Function, and …, 2017