메뉴 건너뛰기




Volumn 2258 LNAI, Issue , 2001, Pages 88-95

Sampling-based relative landmarks: Systematically test-driving algorithms before choosing

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; INTELLIGENT AGENTS; LOGIC PROGRAMMING; STATISTICAL TESTS; ARTIFICIAL INTELLIGENCE; MULTI AGENT SYSTEMS;

EID: 84867773113     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45329-6_12     Document Type: Conference Paper
Times cited : (29)

References (14)
  • 5
    • 84958528434 scopus 로고
    • Characterizing the applicability of classification algorithms using meta-level learning
    • F. Bergadano and L. de Raedt, editors Springer-Verlag
    • P. Brazdil, J. Gama, and B. Henery. Characterizing the applicability of classification algorithms using meta-level learning. In F. Bergadano and L. de Raedt, editors, Proceedings of the European Conference on Machine Learning (ECML-94), pages 83-102. Springer-Verlag, 1994.
    • (1994) Proceedings of the European Conference on Machine Learning (ECML-94) , pp. 83-102
    • Brazdil, P.1    Gama, J.2    Henery, B.3
  • 7
    • 2942643829 scopus 로고    scopus 로고
    • Efficiently determine the starting sample size for progressive sampling
    • P. Flach and L. de Raedt, editors Springer
    • B. Gu, B. Liu, F. Hu, and H. Liu. Efficiently determine the starting sample size for progressive sampling. In P. Flach and L. de Raedt, editors, Proceedings of the 12th European Conference on Machine Learning. Springer, 2001.
    • (2001) Proceedings of the 12th European Conference on Machine Learning
    • Gu, B.1    Liu, B.2    Hu, F.3    Liu, H.4


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