메뉴 건너뛰기




Volumn 1446, Issue , 1998, Pages 80-94

Stochastic propositionalization of non-determinate background knowledge

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; STOCHASTIC SYSTEMS; TIME SERIES ANALYSIS;

EID: 84947420409     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0027312     Document Type: Conference Paper
Times cited : (22)

References (23)
  • 2
    • 0007563290 scopus 로고
    • Learning boolean functions in an infinite attribute space
    • A. Blum. Learning boolean functions in an infinite attribute space. Machine Learning, 9(4), 1992.
    • (1992) Machine Learning , vol.9 , Issue.4
    • Blum, A.1
  • 5
    • 0027652468 scopus 로고
    • Substructure discovery using minimum description length and background knowledge
    • D. J. Cook and L. B. Holder. Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research, 1: 231-255, 1994.
    • (1994) Journal of Artificial Intelligence Research , vol.1 , pp. 231-255
    • Cook, D.J.1    Holder, L.B.2
  • 9
    • 84947474197 scopus 로고    scopus 로고
    • Prediction of rodent carcinogenicity bioassays from molecular structure using inductive logic programming
    • R. D. King and A. Srinivasan. Prediction of rodent carcinogenicity bioassays from molecular structure using inductive logic programming. Environmental Health Perspectives, 1997.
    • (1997) Environmental Health Perspectives
    • King, R.D.1    Srinivasan, A.2
  • 12
    • 77951503082 scopus 로고
    • Inverse Entailment and Progol
    • S. Muggieton. Inverse Entailment and Progol. New Generation Computing, 13: 245-286, 1995.
    • (1995) New Generation Computing , vol.13 , pp. 245-286
    • Muggieton, S.1
  • 13
    • 0001172265 scopus 로고
    • Learning logical definitions from relations
    • J. R. Qninlan. Learning logical definitions from relations. Machine Learning, 5: 239-266, 1990.
    • (1990) Machine Learning , vol.5 , pp. 239-266
    • Qninlan, J.R.1
  • 16
    • 0018015137 scopus 로고
    • Modefing by shortest data description
    • J. Rissanen. Modefing by shortest data description. Automatica, 14: 465-471, 1978.
    • (1978) Automatica , vol.14 , pp. 465-471
    • Rissanen, J.1
  • 18
    • 18544372929 scopus 로고
    • Relational cliches: Constraining constructive induction during relational learning
    • L.A. Birnbaum and G.C. Collins, editors, San Mateo, CA, Morgan Kaufmarm
    • G. Silverstein and M. J. Pazzani. Relational cliches: Constraining constructive induction during relational learning. In L. A. Birnbaum and G. C. Collins, editors, Machine Learning: Proceedings of the Eighth International Workshop (ML91), pages 203-207, San Mateo, CA, 1991. Morgan Kaufmarm.
    • (1991) Machine Learning: Proceedings of the Eighth International Workshop (ML91) , pp. 203-207
    • Silverstein, G.1    Pazzani, M.J.2
  • 22
    • 22944491860 scopus 로고
    • Low size-complexity Inductive Logic Programming: The East-West challenge considered as a problem in cost-sensitive classification
    • Katholieke Universiteit Leuven
    • P. Turney. Low size-complexity Inductive Logic Programming: the East-West challenge considered as a problem in cost-sensitive classification. In Proceedings of the 5th International Workshop on Inductive Logic Programming (ILP-95), pages 247-263. Katholieke Universiteit Leuven, 1995.
    • (1995) Proceedings of the 5th International Workshop on Inductive Logic Programming (ILP-95) , pp. 247-263
    • Turney, P.1


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