TY - GEN
T1 - An Artificial Fish Swarm based supervised gene rank aggregation algorithm for informative genes studies
AU - Du, Nan
AU - Schwartz, Stanley A.
AU - Mahajan, Supriya D.
AU - Hsiao, Chiu Bin
AU - Nair, Bindukumar B.
AU - Zhang, Aidong
PY - 2011
Y1 - 2011
N2 - As the widespread use of high-throughput genomic and protein analysis, more and more experiments have been done to identify the informative genes for various diseases, thus it provides researchers an opportunity to aggregate across multiple microarray experiments via a rank aggregation approach. However, most of current's microarray rank aggregation methods are either unweighted or prespecified weighted, which has obvious defects. In this paper, We define a new method to weight each ranked list automatically by considering its distances to the other ranked lists and the agreement with some priori knowledge. Then the problem of integrating ranked lists can be formulated as minimizing an objective criterion which is proved to be NP-hard. Accordingly, we use an Artificial Fish Swarm algorithm (AFSA) to solve the well-defined minimization problem of rank aggregation in terms of decision theory. We conduct two sets of experiments to evaluate the performance of our methods. The experimental results show that the proposed approach owns not only the capability of solving optimization problem but also the biological meaning.
AB - As the widespread use of high-throughput genomic and protein analysis, more and more experiments have been done to identify the informative genes for various diseases, thus it provides researchers an opportunity to aggregate across multiple microarray experiments via a rank aggregation approach. However, most of current's microarray rank aggregation methods are either unweighted or prespecified weighted, which has obvious defects. In this paper, We define a new method to weight each ranked list automatically by considering its distances to the other ranked lists and the agreement with some priori knowledge. Then the problem of integrating ranked lists can be formulated as minimizing an objective criterion which is proved to be NP-hard. Accordingly, we use an Artificial Fish Swarm algorithm (AFSA) to solve the well-defined minimization problem of rank aggregation in terms of decision theory. We conduct two sets of experiments to evaluate the performance of our methods. The experimental results show that the proposed approach owns not only the capability of solving optimization problem but also the biological meaning.
KW - Artificial Fish Swarm algorithm
KW - Automated weighted
KW - Gene rank aggregation
KW - Microarrays
UR - https://www.scopus.com/pages/publications/84856659478
U2 - 10.2316/P.2011.753-019
DO - 10.2316/P.2011.753-019
M3 - Conference contribution
AN - SCOPUS:84856659478
SN - 9780889869042
T3 - Proceedings of the 6th IASTED International Conference on Computational Intelligence and Bioinformatics, CIB 2011
SP - 114
EP - 121
BT - Proceedings of the 6th IASTED International Conference on Computational Intelligence and Bioinformatics, CIB 2011
T2 - 6th IASTED International Conference on Computational Intelligence and Bioinformatics, CIB 2011
Y2 - 7 November 2011 through 9 November 2011
ER -