The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynami
A multilevel tabu search algorithm for the feature selection problem in biomedical data
โ Scribed by Idowu O. Oduntan; Michel Toulouse; Richard Baumgartner; Christopher Bowman; Ray Somorjai; Teodor G. Crainic
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 817 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
โฆ Synopsis
The automated analysis of patients' biomedical data can be used to derive diagnostic and prognostic inferences about the observed patients. Many noninvasive techniques for acquiring biomedical samples generate data that are characterized by a large number of distinct attributes (i.e., features) and a small number of observed patients (i.e., samples). Using these biomedical data to derive reliable inferences, such as classifying a given patient as either cancerous or noncancerous, requires that the ratio r of the number of samples to the number of features be within the range 5 < r < 10. To satisfy this requirement, the original set of features in the biomedical data has to be reduced to an 'optimal' subset of features that most enhances the classification of the observed patients.
In this paper, we propose a new feature selection technique (multilevel feature selection) that seeks the 'optimal' feature subset in biomedical data using a multilevel search algorithm. This algorithm combines a hierarchical search framework with a tabu search method. The framework consists of increasingly coarse forms (i.e., search subspaces) of the original feature space that are strategically and progressively explored by the tabu search method. The result of the search at any given coarse subspace is used to initialize the search at the previous less coarse subspace.
We evaluate the performance of the proposed technique in terms of the solution quality, using experiments that compare the classification inferences derived from the solution found, with those derived from other feature selection techniques such as the sequential forward selection, random feature selection and tabu search feature selection. An equivalent amount of computational resource is allocated to the evaluated techniques to provide a common basis for comparison. The empirical results show that the multilevel feature selection technique finds 'optimal' subsets that enable more accurate and stable classification than those obtained by using the other feature selection techniques.
๐ SIMILAR VOLUMES