메뉴 건너뛰기




Volumn 1720, Issue , 1999, Pages 1-12

Tailoring representations to different requirements

Author keywords

[No Author keywords available]

Indexed keywords

MACHINE LEARNING;

EID: 84957095032     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46769-6_1     Document Type: Conference Paper
Times cited : (3)

References (33)
  • 1
    • 40249105445 scopus 로고
    • The justification of logical theories based on data compression
    • A. Srinivasan, S. Muggleton, and M. Bain. The justification of logical theories based on data compression. Machine Intelligence, 13, 1993.
    • (1993) Machine Intelligence , vol.13
    • Srinivasan, A.1    Muggleton, S.2    Bain, M.3
  • 2
    • 0141771231 scopus 로고    scopus 로고
    • Data-driven constructive induction: Metodology and applications
    • Huan Liu and Hiroshi Motoda, editors, chapter 4, Kluwer
    • Eric Bloedorn and Ryszard Michalski. Data-driven constructive induction: Metodology and applications. In Huan Liu and Hiroshi Motoda, editors, Feature Extraction, Construction, and Selection - A Data Mining Perpective, chapter 4, pages 51-68. Kluwer, 1998.
    • (1998) Feature Extraction, Construction, and Selection - A Data Mining Perpective , pp. 51-68
    • Bloedorn, E.1    Michalski, R.2
  • 3
    • 84957072123 scopus 로고
    • Learnability of restricted logic programs
    • Bled
    • William W. Cohen. Learnability of restricted logic programs. In ILP'93Workshop, Bled, 1993.
    • (1993) ILP'93Workshop
    • Cohen, W.W.1
  • 4
    • 0028494777 scopus 로고
    • Complexity-based induction
    • D. Conklin and I.Witten. Complexity-based induction. Machine Learning, 16:203-225, 1994.
    • (1994) Machine Learning , vol.16 , pp. 203-225
    • Conklin, D.1    Witten, I.2
  • 6
    • 0006741082 scopus 로고
    • On the decomposition of chain datalog programs into p (left-)linear l-rule components
    • G. Dong and S. Ginsburg. On the decomposition of chain datalog programs into p (left-)linear l-rule components. Logic Programming, 23:203-236, 1995.
    • (1995) Logic Programming , vol.23 , pp. 203-236
    • Dong, G.1    Ginsburg, S.2
  • 7
    • 0002047785 scopus 로고    scopus 로고
    • Inductive logic programming and knowledge discovery in databases
    • Usama M. Fayyad, Gregory Piatetsky-Shapiro, Padhraic Smyth, and Ramasamy Uthurusamy, editors, chapter 1, AAAI Press/The MIT Press, Menlo Park, California
    • Saso Dzeroski. Inductive logic programming and knowledge discovery in databases. In Usama M. Fayyad, Gregory Piatetsky-Shapiro, Padhraic Smyth, and Ramasamy Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, chapter 1, pages 117-152. AAAI Press/The MIT Press, Menlo Park, California, 1996.
    • (1996) Advances in Knowledge Discovery and Data Mining , pp. 117-152
    • Dzeroski, S.1
  • 8
    • 0345052053 scopus 로고
    • Controlling the complexity of learning in logic through syntactic and task-oriented models
    • StephenMuggleton, editor, number 38 in The A.P.I.C. Series, chapter 16, Academic Press, London [u.a.]
    • J.-U. Kietz and S. Wrobel. Controlling the complexity of learning in logic through syntactic and task-oriented models. In StephenMuggleton, editor, Inductive Logic Programming., number 38 in The A.P.I.C. Series, chapter 16, pages 335-360. Academic Press, London [u.a.], 1992.
    • (1992) Inductive Logic Programming , pp. 335-360
    • Kietz, J.-U.1    Wrobel, S.2
  • 9
  • 10
    • 0004951436 scopus 로고
    • Inductive logic programming and learnability
    • Jörg-Uwe Kietz and Saso Dzeroski. Inductive logic programming and learnability. SIGART-Bulletin, 5(1):22-32, 1994.
    • (1994) SIGART-Bulletin , vol.5 , Issue.1 , pp. 22-32
    • Kietz, J.-U.1    Dzeroski, S.2
  • 11
    • 85152515906 scopus 로고
    • An effiecient subsumption algorithm for inductive logic programming
    • W. Cohen and H. Hirsh, editors, San Francisco, CA, Morgan Kaufmann
    • Jörg-Uwe Kietz and Marcus Lübbe. An effiecient subsumption algorithm for inductive logic programming. In W. Cohen and H. Hirsh, editors, Proceedings of the 11th International Conference on Machine Learning IML-94, San Francisco, CA, 1994. Morgan Kaufmann.
    • (1994) Proceedings of the 11th International Conference on Machine Learning IML-94
    • Kietz, J.-U.1    Lübbe, M.2
  • 12
    • 84957067970 scopus 로고
    • GRDT: Enhancing model-based learning for its application in robot navigation
    • S. Wrobel, editor, GMD-Studien Nr. 237, St. Augustin, Germany, GMD
    • Volker Klingspor. GRDT: Enhancing model-based learning for its application in robot navigation. In S. Wrobel, editor, Proc. of the Fourth Intern. Workshop on Inductive Logic Programming, GMD-Studien Nr. 237, pages 107-122, St. Augustin, Germany, 1994. GMD.
    • (1994) Proc. of the Fourth Intern. Workshop on Inductive Logic Programming , pp. 107-122
    • Klingspor, V.1
  • 14
    • 84973521687 scopus 로고
    • Identifying and using patterns in sequential data
    • K.Jantke, S. Kobayashi, E. Tomita, and T. Yokomori, editors, Springer
    • P. Laird. Identifying and using patterns in sequential data. In K.Jantke, S. Kobayashi, E. Tomita, and T. Yokomori, editors, Procs. of 4th Workshop on Algorithmic Learning Theory, pages 1-18. Springer, 1993.
    • (1993) Procs. of 4th Workshop on Algorithmic Learning Theory , pp. 1-18
    • Laird, P.1
  • 17
    • 0003200711 scopus 로고
    • Research in machine learning and recent progress, classification of methods, and future directions
    • Yves Kodratoff and Ryszard Michalski, editors, volume III, chapter I, Morgan Kaufmann, Los Altos, CA
    • Ryszard S. Michalski and Yves Kodratoff. Research in machine learning and recent progress, classification of methods, and future directions. In Yves Kodratoff and Ryszard Michalski, editors, Machine Learning - an Artificial Intelligence Approach, volume III, chapter I, pages 3-30. Morgan Kaufmann, Los Altos, CA, 1990.
    • (1990) Machine Learning - An Artificial Intelligence Approach , pp. 3-30
    • Michalski, R.S.1    Kodratoff, Y.2
  • 18
    • 0031164522 scopus 로고    scopus 로고
    • A multistrategy approach to relational knowledge discovery in databases
    • jun
    • Katharina Morik and Peter Brockhausen. A multistrategy approach to relational knowledge discovery in databases. Machine Learning Journal, 27(3):287-312, jun 1997.
    • (1997) Machine Learning Journal , vol.27 , Issue.3 , pp. 287-312
    • Morik, K.1    Brockhausen, P.2
  • 19
    • 15544390690 scopus 로고    scopus 로고
    • Incremental signal to symbol processing
    • K.Morik, M. Kaiser, and V. Klingspor, editors, chapter 11, Kluwer Academic Publ
    • Katharina Morik and Stephanie Wessel. Incremental signal to symbol processing. In K.Morik, M. Kaiser, and V. Klingspor, editors, Making Robots Smarter-Combining Sensing and Action through Robot Learning, chapter 11, pages 185-198. Kluwer Academic Publ., 1999.
    • (1999) Making Robots Smarter-Combining Sensing and Action through Robot Learning , pp. 185-198
    • Morik, K.1    Wessel, S.2
  • 20
    • 84957053329 scopus 로고
    • Machine invention of first-order predicates by inverting resolution
    • Los Altos, CA, Morgan Kaufman
    • StephenMuggleton andWray Buntine. Machine invention of first-order predicates by inverting resolution. In Proc. Fifth Intern. Conf. on Machine Learning, Los Altos, CA, 1988. Morgan Kaufman.
    • (1988) Proc. Fifth Intern. Conf. on Machine Learning
    • StephenMuggleton1    Buntine, W.2
  • 21
    • 0001602577 scopus 로고
    • A note on inductive generalization
    • B. Meltzer and D. Michie, editors, chapter 8, American Elsevier
    • Gordon D. Plotkin. A note on inductive generalization. In B. Meltzer and D. Michie, editors, Machine Intelligence, chapter 8, pages 153-163. American Elsevier, 1970.
    • (1970) Machine Intelligence , pp. 153-163
    • Plotkin, G.D.1
  • 24
    • 0018015137 scopus 로고
    • Modeling by shortest data description
    • J. Rissanen. Modeling by shortest data description. Automatica, 14:465-471, 1978.
    • (1978) Automatica , vol.14 , pp. 465-471
    • Rissanen, J.1
  • 25
    • 84918983692 scopus 로고
    • A machine-oriented logic based on the resolution principle
    • J. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41, 1965.
    • (1965) Journal of the ACM , vol.12 , Issue.1 , pp. 23-41
    • Robinson, J.1
  • 26
    • 0040666498 scopus 로고
    • Complexity of computing vapnik-chervonenski dimension
    • K.Jantke, S. Kobayashi, E. Tomita, and T. Yokomori, editors, Springer
    • A. Shinohara. Complexity of computing vapnik-chervonenski dimension. In K.Jantke, S. Kobayashi, E. Tomita, and T. Yokomori, editors, Procs. of 4th Workshop on Algorithmic Learning Theory, pages 279-287. Springer, 1993.
    • (1993) Procs. of 4th Workshop on Algorithmic Learning Theory , pp. 279-287
    • Shinohara, A.1
  • 28
    • 84947985126 scopus 로고    scopus 로고
    • Compression measures in ILP
    • Luc De Raedt, editor, IOS Press
    • Irene Stahl. Compression measures in ILP. In Luc De Raedt, editor, Advances in Inductive Logic Programming, pages 295-307. IOS Press, 1996.
    • (1996) Advances in Inductive Logic Programming , pp. 295-307
    • Stahl, I.1
  • 29
    • 0005500020 scopus 로고    scopus 로고
    • Predicate invention in inductive logic programming
    • Luc DeRaedt, editor, IOS Press
    • Irene Stahl. Predicate invention in inductive logic programming. In Luc DeRaedt, editor, Advances in Inductive Logic Programming, pages 34-47. IOS Press, 1996.
    • (1996) Advances in Inductive Logic Programming , pp. 34-47
    • Stahl, I.1
  • 33
    • 84957093799 scopus 로고    scopus 로고
    • A region-based approah to discovering temporal structures in data
    • Ivan Bratko and Saso Dzeroski, editors, Morgan Kaufmann
    • Wei Zhang. A region-based approah to discovering temporal structures in data. In Ivan Bratko and Saso Dzeroski, editors, Proc. of 16th Int. Conf. on Machine Learning, pages 484-492. Morgan Kaufmann, 1999.
    • (1999) Proc. of 16th Int. Conf. on Machine Learning , pp. 484-492
    • Zhang, W.1


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