Busca avançada
Ano de início
(Referência obtida automaticamente do Web of Science, por meio da informação sobre o financiamento pela FAPESP e o número do processo correspondente, incluída na publicação pelos autores.)

A feature selection technique for inference of graphs from their known topological properties: Revealing scale-free gene regulatory networks

Texto completo
Lopes, Fabricio M. [1] ; Martins, Jr., David C. [2] ; Barrera, Junior [3] ; Cesar, Jr., Roberto M. [3, 4]
Número total de Autores: 4
Afiliação do(s) autor(es):
[1] Univ Tecnol Fed Parana, BR-86300000 Cornelio Procopio, Parana - Brazil
[2] Fed Univ ABC, Santo Andre, SP - Brazil
[3] Univ Sao Paulo, Inst Math & Stat, BR-05508 Sao Paulo - Brazil
[4] Brazilian Bioethanol Sci & Technol Lab CTBE, Campinas, SP - Brazil
Número total de Afiliações: 4
Tipo de documento: Artigo Científico
Fonte: INFORMATION SCIENCES; v. 272, p. 1-15, JUL 10 2014.
Citações Web of Science: 31

An important problem in bioinformatics is the inference of gene regulatory networks (GRNs) from expression profiles. In general, the main limitations faced by GRN inference methods are the small number of samples with huge dimensionalities and the noisy nature of the expression measurements. Alternatives are thus needed to obtain better accuracy for the GRNs inference problem. Many pattern recognition techniques rely on prior knowledge about the problem in addition to the training data to gain statistical estimation power. This work addresses the GRN inference problem by modeling prior knowledge about the network topology. The main contribution of this paper is a novel methodology that aggregates scale-free properties to a classical low-cost feature selection method, known as Sequential Floating Forward Selection (SFFS), for guiding the inference task. Such methodology explores the search space iteratively by applying a scale-free property to reduce the search space. In this way, the search space traversed by the method integrates the exploration of all combinations of predictors set when the number of combinations is small (dimensionality (k) <= 2) with a floating search when the number of combinations becomes explosive (dimensionality (k) >= 3). This process is guided by scale-free prior information. Experimental results using synthetic and real data show that this technique provides smaller estimation errors than those obtained without guiding the SFFS application by the scale-free model, thus maintaining the robustness of the SFFS method. Therefore, we show that the proposed framework may be applied in combination with other existing GRN inference methods to improve the prediction accuracy of networks with scale-free properties. (C) 2014 Elsevier Inc. All rights reserved. (AU)

Processo FAPESP: 11/50761-2 - Modelos e métodos de e-Science para ciências da vida e agrárias
Beneficiário:Roberto Marcondes Cesar Junior
Linha de fomento: Auxílio à Pesquisa - Temático