메뉴 건너뛰기




Volumn 1, Issue , 2009, Pages 871-875

Computable and incomputable functions and search algorithms

Author keywords

Bias; Induction; Machine learning; No free lunch theorem (NFL); Optimization; Search

Indexed keywords

FINITE DOMAINS; INDUCTION; INDUCTION MACHINES; INFINITE DOMAINS; KOLMOGOROV COMPLEXITY; NATURAL NUMBER; NO FREE LUNCH THEOREM; OTHER ALGORITHMS; OUTPUT VALUES; SEARCH ALGORITHMS; SEARCH SPACES;

EID: 77949586509     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICICISYS.2009.5358045     Document Type: Conference Paper
Times cited : (12)

References (12)
  • 3
    • 0004000055 scopus 로고
    • No free lunch theorems for search
    • Technical Report SFI-TR-95-02-010
    • D. H. Wolpert and W. G. Macready. No free lunch theorems for search. Technical Report SFI-TR-95-02-010, 1995
    • (1995)
    • Wolpert, D.H.1    Macready, W.G.2
  • 5
    • 0003922190 scopus 로고    scopus 로고
    • 2nd Edition) 654 pages, Wiley-Interscience; 2 edition October
    • Richard O. Duda, Peter E. Hart, David G. Stork, Pattern Classification (2nd Edition) 654 pages, Wiley-Interscience; 2 edition (October 2000)
    • (2000) Pattern Classification
    • Duda, R.O.1    Hart, P.E.2    Stork, D.G.3
  • 6
    • 84941457195 scopus 로고
    • Knowing and Guessing: A Quantitative Study of Inference and Information
    • Watanabe, Satosi 1969 Knowing and Guessing: A Quantitative Study of Inference and Information. New York: Wiley. pp. 376-377.
    • (1969) New York: Wiley , pp. 376-377
    • Watanabe, S.1
  • 7
    • 77949647959 scopus 로고    scopus 로고
    • C. Schumacher and M. Vose and D. Whitley. The No Free Lunch and Problem Description Length. GECCO 2001
    • C. Schumacher and M. Vose and D. Whitley. The No Free Lunch and Problem Description Length. GECCO 2001
  • 8
    • 14644400013 scopus 로고    scopus 로고
    • PhD thesis, University of Tennessee, Department of Computer Sciences, Knoxville, TN
    • C. Schumacher. Fundamental Limitations of Search. PhD thesis, University of Tennessee, Department of Computer Sciences, Knoxville, TN, 2000.
    • (2000) Fundamental Limitations of Search
    • Schumacher, C.1
  • 10
    • 0033258157 scopus 로고    scopus 로고
    • Scaling of Program Fitness Spaces
    • William B. Langdon, Evolutionary Computation 7(4): pages 399-428 Scaling of Program Fitness Spaces
    • Evolutionary Computation , vol.7 , Issue.4 , pp. 399-428
    • Langdon, W.B.1
  • 11
    • 77949648910 scopus 로고
    • The need for biases in learning generalizations Rutgers University, Department of Computer Science, Technical Report CBM-TR-117
    • T. M. Mitchell, The need for biases in learning generalizations (Rutgers University, Department of Computer Science, Technical Report CBM-TR-117, 1980).
    • (1980)
    • Mitchell, T.M.1
  • 12
    • 84947735497 scopus 로고    scopus 로고
    • D. Randall Wilson , Tony R. Martinez, Bias and the probability of generalization, Proceedings of the 1997 IASTED International Conference on Intelligent Information Systems ,1997 , IEEE Computer Society
    • D. Randall Wilson , Tony R. Martinez, Bias and the probability of generalization, Proceedings of the 1997 IASTED International Conference on Intelligent Information Systems ,1997 , IEEE Computer Society


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