Integer programming models and algorithms for molecular classification of cancer from microarray data

Conferences in Research and Practice in Information Technology Series

Volumn 38, Issue , 2005, Pages 361-370

  Berretta, Regina ^a   Mendes, Alexandre ^a   Moscato, Pablo ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

Combinatorial optimisation; Data mining; Feature selection; NCI60

Indexed keywords

ALGORITHMIC METHODS; CELL LINES; DATA MINING MODELS; DATA SETS; FEATURE SELECTION PROBLEM; GENE EXPRESSION LEVELS; HIGH-THROUGHPUT TECHNOLOGIES; INTEGER PROGRAMMING MODELS; LIFE-SCIENCES; MICROARRAY DATA; MICROARRAY TECHNOLOGIES; MOLECULAR CLASSIFICATION; NCI60; SYSTEMATIC EXPLORATION;

ALGORITHMS; CELL CULTURE; COMBINATORIAL OPTIMIZATION; COMPUTER SCIENCE; DISEASES; FEATURE EXTRACTION; GENE EXPRESSION; INTEGER PROGRAMMING; MATHEMATICAL MODELS;

DATA MINING;

EID: 84868673937     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Bø, T.H., Dysvik B. & Jonassen, I. (2004), LSimpute: accurate estimation of missing values in microarray data with least squares methods, Nucleic Acids Research 32(3), e34.
2. Caprara, A., Toth, P. & Fischetti, M. (2000), Algorithms for the Set Covering Problem, Annals of Operations Research 98, 353-371.
3. Cotta, C., Mendes, A., Garcia, V., França, P. & Moscato, P. (2003), Applying Memetic Algorithms to the Analysis of Microarray Data, Proceedings of EvoBIO2003 - 1st European Workshop on Evolutionary Bioinformatics, Lecture Notes in Computer Science 2611, 22-32, Springer-Verlag, Colchester, England.
4. Cotta, C. & Moscato, P. (2003), The k-Feature Set problem is W[2]-complete, Journal of Computer and System Sciences 67, 686-690.
5. Cotta, C., Sloper, C. & Moscato, P. (2004), Evolutionary search of thresholds for robust feature set selection: application to the analysis of microarray data, Applications of Evolutionary Computing, G. Raidl et al. (eds.), Lecture Notes in Computer Science 3005, 21-30, Springer-Verlag, Berlin.
6. Dash, M & Liu, H. (1997), Feature Selection for Classification, Intelligent Data Analysis, 1(3), 131-156.
7. Dash, M. & Liu, H. (2003), Consistency-Based Search in Feature Selection, Artificial Intelligence Journal 151 (1-2), 155-176.
8. Davies, S. & Russell, S. (1994), NP-completeness of searches for smallest possible feature sets, Proceedings of the AAAI Fall Symposium on Relevance, New Orleans, USA.
9. Frank, A. (2002), A New Branch Bound Feature Selection Algorithm, Master Thesis, Israel Institute of Technology.
10. Garfinkel, R.S. & Nemhauser, G.L. (1972), Integer Programming, New York: John Wiley & Sons.
11. Liu, H. & Wong, L. (2003), Data mining Tools for Biological Sequences, Journal of Bioinformatics and Computational Biology 1(2), 139-167.
12. ILOG CPLEX 9.0, http://www.ilog.com/products/cplex/
13. Marx, J. (2000), DNA Arrays reveal cancer in its many forms, Science 289, 1670-1672.
14. Quackenbush, J. (2001), Computational analysis of cDNA microarray data, Nature Reviews 2(6), 418-428.
15. Ross, D.T., Scherf U., Eisen M.B, et al. (2000), Systematic variation in gene expression patterns in human cancer cell lines. Nature Genetics 24(3), 227-235. (Pubitemid 30132189)
16. Waddell P.J. & Kishino, H. (2000), Cluster Inference Methods and Graphical Models Evaluated on NCI60 Microarray Gene Expression Data, Genome Informatics 11, 129-140.
17. Yu, L. & Liu, H. (2004), Redundancy Based Feature Selection for Microarray Data, SIGKDD, KDD 2004, 22-25, Seattle, Washington, USA.