DocumentCode
3410079
Title
Boosted PRIM with application to searching for oncogenic pathway of lung cancer
Author
Wang, Pei ; Kim, Young ; Pollack, Jonathan ; Tibshirani, Robert
Author_Institution
Stanford Univ., CA, USA
fYear
2004
fDate
16-19 Aug. 2004
Firstpage
604
Lastpage
609
Abstract
Boosted PRIM (patient rule induction method) is a new algorithm developed for two-class classification problems. PRIM is a variation of those tree-based methods, seeking box-shaped regions in the feature space to separate different classes. Boosted PRIM is to implement PRIM-styled weak learners in Adaboost, one of the most popular boosting algorithms. In addition, we improve the performance of the algorithm by introducing a regularization to the boosting process, which supports the perspective of viewing boosting as a steepest-descent numerical optimization by Jerry Friedman. The motivation for boosted PRIM is to solve the problem of "searching for oncogenic pathways" based on array-CGH (comparative genomic hybridization) data, though the algorithm itself is suitable for general classification problems. We illustrate the performance of the method through some simulation studies as well as an application on a lung cancer array-CGH data set.
Keywords
cancer; classification; genetics; lung; medical computing; optimisation; trees (mathematics); Adaboost; PRIM-styled weak learners; array-comparative genomic hybridization data; boosted PRIM; boosting algorithms; box-shaped regions; lung cancer; oncogenic pathway; patient rule induction method; regularization; steepest-descent numerical optimization; tree-based methods; two-class classification problems; Bioinformatics; Biological system modeling; Boosting; Cancer; DNA; Genetics; Genomics; Lungs; Neoplasms; Statistics;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Systems Bioinformatics Conference, 2004. CSB 2004. Proceedings. 2004 IEEE
Print_ISBN
0-7695-2194-0
Type
conf
DOI
10.1109/CSB.2004.1332514
Filename
1332514
Link To Document