A New Heuristic for Feature Selection by Consistent Biclustering

Details A New Heuristic for Feature Selection by Consistent Biclustering A New Heuristic for Feature Selection by Consistent Biclustering

2010-03-17

arxiv.org/abs/1003.3279v1

Computer Science

Learning

Scientific paper

Given a set of data, biclustering aims at finding simultaneous partitions in biclusters of its samples and of the features which are used for representing the samples. Consistent biclusterings allow to obtain correct classifications of the samples from the known classification of the features, and vice versa, and they are very useful for performing supervised classifications. The problem of finding consistent biclusterings can be seen as a feature selection problem, where the features that are not relevant for classification purposes are removed from the set of data, while the total number of features is maximized in order to preserve information. This feature selection problem can be formulated as a linear fractional 0-1 optimization problem. We propose a reformulation of this problem as a bilevel optimization problem, and we present a heuristic algorithm for an efficient solution of the reformulated problem. Computational experiments show that the presented algorithm is able to find better solutions with respect to the ones obtained by employing previously presented heuristic algorithms.

Affiliated with

Also associated with

No associations

Rating

A New Heuristic for Feature Selection by Consistent Biclustering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A New Heuristic for Feature Selection by Consistent Biclustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Heuristic for Feature Selection by Consistent Biclustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-233357