메뉴 건너뛰기




Volumn 4, Issue , 1998, Pages 25-27

Handling noise with generalized entropy of type beta in induction graphs algorithms

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; ENTROPY; GRAPH THEORY; PROBABILITY;

EID: 1642330046     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (19)

References (12)
  • 5
    • 1642265757 scopus 로고    scopus 로고
    • Concept de diversité et coefficients d'association prédictive
    • Laboratoire ERIC, Université Lyon 2
    • S. Lallich. Concept de diversité et coefficients d'association prédictive. Working paper, Laboratoire ERIC, Université Lyon 2, 1998.
    • (1998) Working Paper
    • Lallich, S.1
  • 6
    • 34249966833 scopus 로고
    • An empirical comparison of selection measures for decision tree induction
    • J. Mingers. An empirical comparison of selection measures for decision tree induction. Machine Learning, 3:319-342, 1989.
    • (1989) Machine Learning , vol.3 , pp. 319-342
    • Mingers, J.1
  • 7
    • 0025389210 scopus 로고
    • Boolean feature discovery in empirical learning
    • G. Pagallo and D. Haussler. Boolean feature discovery in empirical learning. Machine Learning, 5:71-99, 1990.
    • (1990) Machine Learning , vol.5 , pp. 71-99
    • Pagallo, G.1    Haussler, D.2


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