Comparative study of ensemble learning approaches in the identification of disease mutations

Proceedings - 2010 3rd International Conference on Biomedical Engineering and Informatics, BMEI 2010

Volumn 6, Issue , 2010, Pages 2306-2310

  Wu, Jiaxin ^a   Zhang, Wangshu ^a   Jiang, Rui ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Binary classification; Ensemble learning; Nonsynonymous single nucleotide polymorphisms

Indexed keywords

ADABOOST; AMINO ACID SUBSTITUTION; BINARY CLASSIFICATION; BINARY CLASSIFICATION PROBLEMS; BIOMEDICAL RESEARCH; CLASSIFICATION METHODS; COMPARATIVE STUDIES; ENSEMBLE LEARNING; ENSEMBLE LEARNING APPROACH; GENETIC BASIS; GENETIC VARIATION; HUMAN DISEASE; INHERITED DISEASE; LOGITBOOST; MACHINE-LEARNING; PROTEIN CODING REGIONS; PROTEIN SEQUENCES; RANDOM FORESTS; SINGLE NUCLEOTIDE POLYMORPHISMS; STOCHASTIC GRADIENT;

ADAPTIVE BOOSTING; AMINO ACIDS; BIOMEDICAL ENGINEERING; DECISION TREES; GENES; INFORMATION SCIENCE; NUCLEOTIDES; POLYMORPHISM; PROTEINS;

DIAGNOSIS;

EID: 78650653978     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BMEI.2010.5639753     Document Type: Conference Paper

References (20)

1. Lander ES, Schork NJ (1994) Genetic dissection of complex traits. Science 265:2037-2047
2. Balasubramanian S, Xia Y, Freinkman E, Gerstein M (2005) Sequence variation in G-protein-coupled receptors: analysis of single nucleotide polymorphisms. Nucl Acids Res 33:1710-1721 (Pubitemid 41418399)
3. Breiman L, Friedman J, Olshen R, Stone C (1984) Classification and regression trees. Wadsworth, Belmont, CA
4. Vapnik V (1998) Statistical learning theory. JohnWiley, New York
5. Breiman L(2001) Random forests. Machine Learning 45:5-32.
6. Ng PC, Henikoff S (2001) Predicting deleterious amino acid substitutions. Genome Res 11:863-874
7. Arijit C., Jonathan M, Radhika S. A novel ensemble learning method for de novo computational identification of DNA binding sites. BMC Bioinformatics 2007, 8:249.
8. Rui Jiang, Hua Yang, Linqi Zhou, Sequence-Based Prioritization of Nonsynonymous Single-Nucleotide Polymorphisms for the Study of Disease Mutations. AJHG2007, Volume 81: 346-360.
9. VAPNIK V N. Principles of risk minimization for learning theory. Advances in Neural Information Processing Systems 4. San Francisco: Morgan Kaufmann Publishers, 1992: 831-838.
10. Fu Chunfeng, Gou Pengcheng, Zhao Yang, etc. Logitboost and its application in discriminate analysis. China Health Statistics, 2006, 23(2): 98-99.
11. Breiman, L. (2001), "Manual on setting up, using, and understanding random forests", V3.1, http://oz.berkeley.edu/users/breiman/ Using random forests V3.1.pdf, date last accessed: December 12, 2007.
12. Peter Buhlmann and Bin Yu (2003), Boosting with the L2 loss: regression and classification. Journal of the American Statistical Association, 98, 324-339.
13. J H Freidman. Greedy function approximation: a gradient boosting machine. Annals of Statistics, 2001, 29: 1189-1232.
14. The UniProt Consortium (2007) The universal protein resource (UniProt). Nucl Acids Res 35:D193-D197
15. Robert DF, Jaina M, Berjamin SB, Sam GJ, Volker H, Timo L, Simon M, Mhairi M, Ajay K, Richard D, et al (2006) Pfam: clans, web tools and services. Nucl Acids Res 34:D247-D251
16. Li Kai, CUI Li-juan (2008). Diversity and Performance Comparison for Ensemble Learning Algorithm. Computer Engineering, Vol.34, No.6: 35-37.
17. Carolin Strobl, Anne-Laure B, Achim Z. Bias in random forest variable importance measures: Illustrations, sources and a solution. BMC Bioinformatics 2007, 8:25
18. Peter Buhlmann (2006), Boosting for high-dimensional linear models. The Annals of Statistics, 34(2), 559-583.
19. Peter Buhlmann and Torsten Hothorn (2007), Boosting algorithms: regularization, prediction and model fitting. Statistical Science, 22(4), 477-505.
20. Jiang R, Yang H, Sun F, Chen T (2006) Searching for interpretable rules for disease mutations: a simulated annealing bump hunting strategy. BMC Bioinformatics 7:417