메뉴 건너뛰기




Volumn 1910, Issue , 2000, Pages 345-352

A genetic algorithm-based solution for the problem of small disjuncts

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DECISION TREES; GENETIC ALGORITHMS;

EID: 84974686170     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45372-5_35     Document Type: Conference Paper
Times cited : (15)

References (13)
  • 7
    • 0002448383 scopus 로고
    • Concept Learning and the Problem of Small Disjuncts
    • HOLTE, R.C.; ACKER, L.E. and PORTER, B.W. (1989). Concept Learning and the Problem of Small Disjuncts, Proc. IJCAI-89, 813-818.
    • (1989) Proc. IJCAI-89 , pp. 813-818
    • Holte, R.C.1    Acker, L.E.2    Porter, B.W.3
  • 9
    • 0003222041 scopus 로고    scopus 로고
    • Estimating concept difficulty with cross entropy
    • Bramer, M.A. (Ed.), London: IEE
    • NAZAR, K. and BRAMER, M.A. (1999) Estimating concept difficulty with cross entropy. In: Bramer, M.A. (Ed.) Knowledge Discovery and Data Mining, 3-31. London: IEE.
    • (1999) Knowledge Discovery and Data Mining , pp. 3-31
    • Nazar, K.1    Bramer, M.A.2
  • 11
    • 0030127467 scopus 로고    scopus 로고
    • Scaling up inductive learning with massive parallelism
    • Apr., 1996
    • PROVOST, F. and ARONIS, J.M. (1996). Scaling up inductive learning with massive parallelism. Machine Learning 23(1), Apr. 1996, 33-46.
    • (1996) Machine Learning , vol.23 , Issue.1 , pp. 33-46
    • Provost, F.1    Aronis, J.M.2
  • 13
    • 0000686085 scopus 로고
    • Learning hard concepts through constructive induction: Framework and rationale
    • RENDELL, L. and SESHU, R. (1990) Learning hard concepts through constructive induction: framework and rationale. Computational Intelligence 6, 247-270.
    • (1990) Computational Intelligence , vol.6 , pp. 247-270
    • Rendell, L.1    Seshu, R.2


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