enriquecimiento del conocimiento previo en programaciÃ³n lÃ³gica ...

More documents

Recommendations

Info

Referencias[1] S. ANTHONY AND A. M. FRISCH, Generating numerical literals during refinement, in Inductive LogicProgramming: 7th International Workshop, ILP-97, Springer Verlag, 1997, pp. 61–76.[2] S. AUGIER, G. VENTURINI, AND Y. KODRATOFF, Learning first order logic rules with a geneticalgorithm, in in Proc. 1st Int. Conf. on Knowledge Discovery and Data Mining, AAAI Press, 1995,pp. 21–26.[3] H. BLOCKEEL AND L. D. RAEDT, Lookahead and discretization in ilp, in In Proceedings of the 7thInternational Workshop on Inductive Logic Programming, Springer-Verlag, 1997, pp. 77–85.[4] , Top-down induction of logical decision trees, in Artificial Intelligence, 1998.[5] M. BOTTA AND A. GIORDANA, Smart+: A multi-strategy learning tool, in IJCAI, 1993, pp. 937–945.[6] J. CATLETT, On changing continuous attributes into ordered discrete attributes, in Proceedings of theEuropean working session on learning on Machine learning, New York, NY, USA, 1991, Springer-Verlag New York, Inc., pp. 164–178.[7] P. CLARK AND T. NIBLETT, The cn2 induction algorithm, in MACHINE LEARNING, 1989, pp. 261–283.[8] A. P. DEMPSTER, N. M. LAIRD, AND D. B. RUBIN, Maximum likelihood from incomplete datavia the em algorithm, JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B, 39 (1977),pp. 1–38.[9] F. DIVINA, M. KEIJZER, AND E. MARCHIORI, A method for handling numerical attributes in gabasedinductive concept learners, in Proceedings of the 2003 international conference on Genetic andevolutionary computation: PartI, GECCO’03, Berlin, Heidelberg, 2003, Springer-Verlag, pp. 898–908.[10] F. DIVINA AND E. MARCHIORI, Evolutionary concept learning, in GECCO 2002: Proceedings of theGenetic and Evolutionary Computation Conference, W. B. Langdon, E. Cantú-Paz, K. Mathias, R. Roy,D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M. A. Potter, A. C.Schultz, J. F. Miller, E. Burke, and N. Jonoska, eds., New York, 9-13 July 2002, Morgan KaufmannPublishers, pp. 343–350.[11] , Handling continuous attributes in an evolutionary inductive learner, IEEE Transactions on EvolutionaryComputation, 9 (2005), pp. 31–43.17
REFERENCIAS 18[12] U. M. FAYYAD AND K. B. IRANI, Multi-interval discretization of continuous-valued attributes forclassification learning, in IJCAI, 1993, pp. 1022–1029.[13] A. FRANK AND A. ASUNCION, UCI machine learning repository, 2010. http://archive.ics.uci.edu/ml.[14] J. H. HOLLAND, Adaptation in Natural and Artificial Systems, The University of Michigan Press,1975.[15] E. B. HUNT, Experiments in induction, Academic Press, New York, 1966.[16] M. I, Newgem: Program for learning from examples technical documentation and user’s guide., tech.report, Department of Computer Science, University of Illinois, Urbana Champaign, IL, 1985.[17] J. JAFFAR AND J.-L. LASSEZ, Constraint logic programming, in POPL, 1987, pp. 111–119.[18] H. KIM AND W.-Y. LOH, Classification trees with unbiased multiway splits, Journal of the AmericanStatistical Association, (2001), pp. 589–604.[19] W. V. LAER, S. DZEROSKI, AND L. D. RAEDT, Multi-class problems and discretization in icl (extendedabstract), in In Proceedings of the MLnet Familiarization Workshop on Data Mining with InductiveLogic Programming (ILP for KDD, 1996, pp. 53–60.[20] W. V. LAER, L. D. RAEDT, AND S. DZEROSKI, On multi-class problems and discretization in inductivelogic programming, in Proceedings of the 10th International Symposium on Foundations ofIntelligent Systems, ISMIS ’97, London, UK, 1997, Springer-Verlag, pp. 277–286.[21] N. LAVRAC, S. DZEROSKI, AND M. GROBELNIK, Learning nonrecursive definitions of relations withlinus, in Proceedings of the European Working Session on Machine Learning, EWSL ’91, London,UK, UK, 1991, Springer-Verlag, pp. 265–281.[22] W.-Y. LOH AND Y.-S. SHIH, Split selection methods for classification trees, Statistica Sinica, (1997),pp. 815–840.[23] D. MALERBA, F. ESPOSITO, G. SEMERARO, AND S. CAGGESE, Handling continuous data in topdowninduction of first-order rules, in AI*IA, 1997, pp. 24–35.[24] S. MUGGLETON AND L. D. RAEDT, Inductive logic programming: Theory and methods, Journal ofLogic Programming, 19/20 (1994), pp. 629–679.[25] J. R. QUINLAN, Learning logical definitions from relations, Machine Learning, 5 (1990), pp. 239–266.[26] A. SRINIVASAN, The Aleph Manual, 2004. http://www.comlab.ox.ac.uk/activities/machinelearning/Aleph/.
Page 1: Posgrado en Ciencias y Tecnologías
Page 4 and 5: Capítulo 1IntroducciónDentro de l
Page 6 and 7: 1. Introducción 3p (X, Z) ← r (X
Page 8 and 9: 2. Problemática 52.2 Operadores de
Page 10 and 11: Capítulo 3Revisión de métodosA c
Page 12 and 13: 3. Revisión de métodos 93.2 Progr
Page 14 and 15: 3. Revisión de métodos 11Para mod
Page 16 and 17: 3. Revisión de métodos 13analizar
Page 18 and 19: 4. Propuesta 15- A. Sistema ILP∗
Page 22 and 23: Apéndice ALógica de Primer OrdenA

enriquecimiento del conocimiento previo en programaciÃ³n lÃ³gica ...

Create successful ePaper yourself

Delete template?

Save as template?