메뉴 건너뛰기




Volumn 55, Issue 5, 2008, Pages 889-899

Logic classification and feature selection for biomedical data

Author keywords

Combinatorial feature selection; Logic data mining; Set Covering

Indexed keywords

CLASSIFICATION (OF INFORMATION); COMPUTATIONAL COMPLEXITY; DATA MINING; PROBLEM SOLVING; SET THEORY;

EID: 38349134271     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2006.12.093     Document Type: Article
Times cited : (26)

References (29)
  • 2
    • 38349096976 scopus 로고    scopus 로고
    • Allison D.B., Page G.P., Beasley T.M., and Edwards J.W. (Eds), Chapman Hall/CRC Press, UK
    • In: Allison D.B., Page G.P., Beasley T.M., and Edwards J.W. (Eds). DNA Microarrays and Related Genomic Techniques. Biostatistics Book Series (2005), Chapman Hall/CRC Press, UK
    • (2005) Biostatistics Book Series
  • 3
    • 18044376669 scopus 로고    scopus 로고
    • Kwok P.-Y. (Ed), Human Press Inc, Totowa, New Jersey
    • In: Kwok P.-Y. (Ed). Single Nucleotide Polymorphism: Methods and Protocols. Methods in Molecular Biology (2003), Human Press Inc, Totowa, New Jersey
    • (2003) Methods in Molecular Biology
  • 4
    • 10344250583 scopus 로고    scopus 로고
    • A minsat approach for learning in logic domains
    • Felici G., and Truemper K. A minsat approach for learning in logic domains. INFORMS Journal on Computing 13 3 (2001) 1-17
    • (2001) INFORMS Journal on Computing , vol.13 , Issue.3 , pp. 1-17
    • Felici, G.1    Truemper, K.2
  • 6
    • 85088356168 scopus 로고    scopus 로고
    • Branch-and-bound algorithms for the test cover problem
    • ESA 2002: 10th Annual European Symposium on Algorithms, Springer, Berlin
    • De Bontridder Koen M.J., Lageweg B.J., Lenstra J.K., Orlin J.B., and Stougie L. Branch-and-bound algorithms for the test cover problem. ESA 2002: 10th Annual European Symposium on Algorithms. Lecture Notes in Computer Science (2002), Springer, Berlin 737-742
    • (2002) Lecture Notes in Computer Science , pp. 737-742
    • De Bontridder Koen, M.J.1    Lageweg, B.J.2    Lenstra, J.K.3    Orlin, J.B.4    Stougie, L.5
  • 10
    • 0003076895 scopus 로고    scopus 로고
    • Feature selection for high-dimensional genomic microarray data
    • Morgan Kaufmann, San Francisco, CA
    • Xing E.P., Jordan M.I., and Karp R.M. Feature selection for high-dimensional genomic microarray data. Proc. 18th International Conf. on Machine Learning (2001), Morgan Kaufmann, San Francisco, CA 601-608
    • (2001) Proc. 18th International Conf. on Machine Learning , pp. 601-608
    • Xing, E.P.1    Jordan, M.I.2    Karp, R.M.3
  • 13
    • 17044412032 scopus 로고    scopus 로고
    • D.A. Peterson, M.H. Tahut, Model and feature selection in microarray classification, in: IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2004, pp. 56-60
  • 14
    • 0035826360 scopus 로고    scopus 로고
    • Identifying marker genes in transcription profiling data using a mixture of feature relevance experts
    • Chow M.L., Moler E.J., and Mian I.S. Identifying marker genes in transcription profiling data using a mixture of feature relevance experts. Physiological Genomics 5 (2001) 99-111
    • (2001) Physiological Genomics , vol.5 , pp. 99-111
    • Chow, M.L.1    Moler, E.J.2    Mian, I.S.3
  • 15
    • 3042621436 scopus 로고    scopus 로고
    • Prediction of saccharomyces cerevisae protein functional class from functional domain composition
    • Cai Y., and Doig A.J. Prediction of saccharomyces cerevisae protein functional class from functional domain composition. Bioinformatics 20 8 (2004) 1292-1300
    • (2004) Bioinformatics , vol.20 , Issue.8 , pp. 1292-1300
    • Cai, Y.1    Doig, A.J.2
  • 16
    • 4043081192 scopus 로고    scopus 로고
    • Data mining and genetic algorithm based gene/snp selection
    • Shah S.C., and Kusiak A. Data mining and genetic algorithm based gene/snp selection. Artificial Intelligence in Medicine 31 3 (2004) 183-196
    • (2004) Artificial Intelligence in Medicine , vol.31 , Issue.3 , pp. 183-196
    • Shah, S.C.1    Kusiak, A.2
  • 18
    • 38349114099 scopus 로고    scopus 로고
    • P. Bonizzoni, G. Lancia, R. Rizzi, A practical approach to the healthy versus diseased minimal test collection problem when the tests are powerful, manuscript, 2005
  • 19
    • 0024640804 scopus 로고
    • A probabilistic heuristic for a computationally difficult set covering problem
    • Feo T.A., and Resende M.G.C. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8 (1989) 67-71
    • (1989) Operations Research Letters , vol.8 , pp. 67-71
    • Feo, T.A.1    Resende, M.G.C.2
  • 21
    • 0012587086 scopus 로고    scopus 로고
    • Greedy randomized adaptive search procedures
    • Glover F., and Kochenberger G. (Eds), Kluwer
    • Resende M.G.C., and Ribeiro C.C. Greedy randomized adaptive search procedures. In: Glover F., and Kochenberger G. (Eds). State-of-the-Art Handbook of Metaheuristics (2002), Kluwer 219-249
    • (2002) State-of-the-Art Handbook of Metaheuristics , pp. 219-249
    • Resende, M.G.C.1    Ribeiro, C.C.2
  • 22
    • 84888798224 scopus 로고    scopus 로고
    • Grasp: An annotated bibliography
    • Ribeiro C.C., and Hansen P. (Eds), Kluwer Academic Publishers
    • Festa P., and Resende M.G.C. Grasp: An annotated bibliography. In: Ribeiro C.C., and Hansen P. (Eds). Essays and Surveys on Metaheuristics (2002), Kluwer Academic Publishers 325-367
    • (2002) Essays and Surveys on Metaheuristics , pp. 325-367
    • Festa, P.1    Resende, M.G.C.2
  • 24
    • 0033077671 scopus 로고    scopus 로고
    • Logical analysis of binary data with missing bits
    • Boros E., Ibaraki T., and Makino K. Logical analysis of binary data with missing bits. Artificial Intelligence 107 (1999) 219-263
    • (1999) Artificial Intelligence , vol.107 , pp. 219-263
    • Boros, E.1    Ibaraki, T.2    Makino, K.3
  • 25
    • 38349134463 scopus 로고    scopus 로고
    • E. Boros, T. Ibaraki, A. Kogan, E. Mayoraz, I. Muchnik, An implementation of logical analysis of data, RUTCOR Research Report, Rutgers University, NJ, 1996, pp. 29-96
  • 26
    • 0030212491 scopus 로고    scopus 로고
    • On the minimum number of logical clauses which can be inferred from examples
    • Triantaphyllou E., and Soyster A.L. On the minimum number of logical clauses which can be inferred from examples. Computers and Operations Research 23 (1996) 783-799
    • (1996) Computers and Operations Research , vol.23 , pp. 783-799
    • Triantaphyllou, E.1    Soyster, A.L.2
  • 28
    • 38349143613 scopus 로고    scopus 로고
    • C. Hatzis, D. Page, Kdd-2001 cup: The genomics challenge, http://www.cs.wisc.edu/dpage/kddcup2001/, 2001


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.