Computer Science – Computer Vision and Pattern Recognition
Scientific paper
2011-07-25
Computer Science
Computer Vision and Pattern Recognition
10 pages, 5 figures, SFFS search method based on scale-free network topology
Scientific paper
An important problem in bioinformatics is the inference of gene regulatory networks (GRN) from temporal expression profiles. In general, the main limitations faced by GRN inference methods is the small number of samples with huge dimensionalities and the noisy nature of the expression measurements. In face of these limitations, alternatives are needed to get better accuracy on the GRNs inference problem. This work addresses this problem by presenting an alternative feature selection method that applies prior knowledge on its search strategy, called SFFS-BA. The proposed search strategy is based on the Sequential Floating Forward Selection (SFFS) algorithm, with the inclusion of a scale-free (Barab\'asi-Albert) topology information in order to guide the search process to improve inference. The proposed algorithm explores the scale-free property by pruning the search space and using a power law as a weight for reducing it. In this way, the search space traversed by the SFFS-BA method combines a breadth-first search when the number of combinations is small (
Barrera Junior
Cesar-Jr Roberto M.
Lopes Fabricio Martins
Martins-Jr David C.
No associations
LandOfFree
An iterative feature selection method for GRNs inference by exploring topological properties 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 An iterative feature selection method for GRNs inference by exploring topological properties, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An iterative feature selection method for GRNs inference by exploring topological properties will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-573426