ILPnet2 library: 2003

ILP publications in 2003

This is the list of all publications in the ILPnet2 on-line library that were published in 2003. The title of the article is a link to the full reference, including -- if provided by the author -- abstract and URL. It also allows easy access to related publications.

BibTeX file for 2003.

F. De Francesca, G. Gordano, R. Ortale, and A. Tagarelli. Distance-based Clustering of XML Documents. In Luc De Raedt and Takashi Washio, editors, Proceedings of the First International Workshop on Mining Graphs, Trees and Sequences (MGTS-2003), pages 75--78. ECML/PKDD'03 workshop proceedings, September 2003. More behind this link.
W. Geamsakul, T. Matsuda, T. Yoshida, H. Motoda, and T. Washio. Constructing a Decision Tree for Graph Structured Data. In Luc De Raedt and Takashi Washio, editors, Proceedings of the First International Workshop on Mining Graphs, Trees and Sequences (MGTS-2003), pages 1--10. ECML/PKDD'03 workshop proceedings, September 2003. More behind this link.
A. Habrard, M. Bernard, and M. Sebban. Probabilistic Approach for Reduction of Irrelevant Tree-structured Data. In Luc De Raedt and Takashi Washio, editors, Proceedings of the First International Workshop on Mining Graphs, Trees and Sequences (MGTS-2003), pages 11--20. ECML/PKDD'03 workshop proceedings, September 2003. More behind this link.
S. Hoche, T. Horvath, and S. Wrobel. Effective Rule Induction from Molecular Structures Represented by Labeled Graph. In Luc De Raedt and Takashi Washio, editors, Proceedings of the First International Workshop on Mining Graphs, Trees and Sequences (MGTS-2003), pages 21--32. ECML/PKDD'03 workshop proceedings, September 2003. More behind this link.
T. Horvath, R. H. Sloan, and G. Turan. Learning Logic Programs with Unary Partial Function Graph Background Knowledge. In Luc De Raedt and Takashi Washio, editors, Proceedings of the First International Workshop on Mining Graphs, Trees and Sequences (MGTS-2003), pages 33--44. ECML/PKDD'03 workshop proceedings, September 2003. More behind this link.
A. Inokuchi, T. Washio, and H. Motoda. Specific Biasis for Mining Frequent Substructures. In Luc De Raedt and Takashi Washio, editors, Proceedings of the First International Workshop on Mining Graphs, Trees and Sequences (MGTS-2003), pages 45--54. ECML/PKDD'03 workshop proceedings, September 2003. More behind this link.
T. Murata. Graph Mining Approaches for the Discovery of Web Communities. In Luc De Raedt and Takashi Washio, editors, Proceedings of the First International Workshop on Mining Graphs, Trees and Sequences (MGTS-2003), pages 79--82. ECML/PKDD'03 workshop proceedings, September 2003. More behind this link.
S. Nijssen and J. N. Kok. Effcient Discovery of Frequent Unordered Trees. In Luc De Raedt and Takashi Washio, editors, Proceedings of the First International Workshop on Mining Graphs, Trees and Sequences (MGTS-2003), pages 55--64. ECML/PKDD'03 workshop proceedings, September 2003. More behind this link.
J. Ramon and T. Gärtner. Expressivity versus Efficiency of Grapgh Kernels. In Luc De Raedt and Takashi Washio, editors, Proceedings of the First International Workshop on Mining Graphs, Trees and Sequences (MGTS-2003), pages 65--74. ECML/PKDD'03 workshop proceedings, September 2003. More behind this link.
J. Blaták and L. Popelínský. Feature Construction with RAP. In T. Horváth and A. Yamamoto, editors, Proceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programming, pages 1--11. Department of Informatics, University of Szeged, September 2003.
E. Gyftodimos and P.A. Flach. Hierarchical {B}ayesian Networks: an Approach to Classification and Learning for Structured Data. In T. Horváth and A. Yamamoto, editors, Proceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programming, pages 12--21. Department of Informatics, University of Szeged, September 2003.
T. Iwasaki, T. Matsui, and H. Ohwada. Predicting and Revising Misclassifications Using ILP. In T. Horváth and A. Yamamoto, editors, Proceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programming, pages 22--29. Department of Informatics, University of Szeged, September 2003.
M.-A. Krogel and S. Wrobel. Facets of Aggregation Approaches to Propositionalization. In T. Horváth and A. Yamamoto, editors, Proceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programming, pages 30--39. Department of Informatics, University of Szeged, September 2003.
M. Nepil. INDEED: a System for Relational Rule Induction in Domains with Rich Space of Constant Terms. In T. Horváth and A. Yamamoto, editors, Proceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programming, pages 40--49. Department of Informatics, University of Szeged, September 2003.
S. Nijssen and J.N. Kok. Weak OI: Ideal Refinement of Datalog Clauses using Primary Keys. In T. Horváth and A. Yamamoto, editors, Proceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programming, pages 50--59. Department of Informatics, University of Szeged, September 2003.
B. Pfahringer and G. Holmes. Propositionalization through Stochastic Discrimination. In T. Horváth and A. Yamamoto, editors, Proceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programming, pages 60--68. Department of Informatics, University of Szeged, September 2003.
A. Puech and S. Muggleton. A Comparison of Stochastic Logic Programs and Bayesian Logic Programs. In T. Horváth and A. Yamamoto, editors, Proceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programming, pages 69--78. Department of Informatics, University of Szeged, September 2003.
R. Ramirez. Extracting Harmonization Rules with Inductive Logic Programming. In T. Horváth and A. Yamamoto, editors, Proceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programming, pages 79--84. Department of Informatics, University of Szeged, September 2003.
M. Serrurier, H. Prade, and G. Richard. Using Simulated Annealing in ILP. In T. Horváth and A. Yamamoto, editors, Proceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programming, pages 85--94. Department of Informatics, University of Szeged, September 2003.
H. Shirai, T. Matsui, and H. Ohwada. Active Background-Knowledge Selection in Inductive Logic Programming. In T. Horváth and A. Yamamoto, editors, Proceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programming, pages 95--104. Department of Informatics, University of Szeged, September 2003.
[[R. Tron\ccon]], H. Vandecasteele, J. Struyf, B. Demoen, and G. Janssens. Query Optimization: Combining Query Packs and the Once-Transformation. In T. Horváth and A. Yamamoto, editors, Proceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programming, pages 105--115. Department of Informatics, University of Szeged, September 2003.
A. Vanassche, D. Krzywania, J. Vaneyghen, J. Struyf, and H. Blockeel. First Order Alternating Decision Trees. In T. Horváth and A. Yamamoto, editors, Proceedings of the Work-in-Progress Track at the 13th International Conference on Inductive Logic Programming, pages 116--125. Department of Informatics, University of Szeged, September 2003.
Lourdes Peña Castillo and Stefan Wrobel. Learning Minesweeper with Multirelational Learning. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, pages 533--538. Academic Press, August 2003. More behind this link.
Evelina Lamma, Fabrizio Riguzzi, and Luís Moniz Pereira. Belief Revision via Lamarckian Evolution. New Generation Computing, 21(3):247--275, May 2003. More behind this link.
J.W. Lloyd. Logic for learning: learning comprehensible theories from structured data. Springer-Verlag, 2003. More behind this link.
D. Malerba. Learning Recursive Theories in the Normal ILP Setting. Fundamenta Informaticae, 57:39--77, 2003. More behind this link.
A. Appice, M. Ceci, and D. Malerba. Mining Model Trees: a Multi Relational Approach. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 4--21. Springer-Verlag, 2003.
M. Arias and R. Khardon. Complexity Parameters for First-Order Classes. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 22--37. Springer-Verlag, 2003.
A. Atramentov, H. Leiva, and V. Honavar. A Multi-Relational Decision Tree Learning Algorithm - Implementation and Experiments. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 38--56. Springer-Verlag, 2003.
F. Baião, M. Mattoso, J. Shavlik, and G. Zaverucha. Applying Theory Revision to the Design of Distributed Databases. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 57--74. Springer-Verlag, 2003.
G. Cleuziou, L. Martin, and C. Vrain. Disjunctive Learning with a Soft-Clustering Method. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 75--92. Springer-Verlag, 2003.
S. Colton and S. Muggleton. ILP for Mathematical Discovery. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 93--111. Springer-Verlag, 2003.
N. Di Mauro, T.M.A. Basile, S. Ferilli, F. Esposito, and N. Fanizzi. An Exhaustive Matching Procedure for the Improvement of Learning Efficiency. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 112--129. Springer-Verlag, 2003.
N. Fonseca, R. Rocha, R. Camacho, and F. Silva. Efficient Data Structures for Inductive Logic Programming. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 130--145. Springer-Verlag, 2003.
T. Gärtner, K. Driessens, and J. Ramon. Graph Kernels and Gaussian Processes for Relational Reinforcement Learning. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 146--163. Springer-Verlag, 2003.
K. Hirata. On Condensation of a Clause. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 164--179. Springer-Verlag, 2003.
S. Hoche and S. Wrobel. A Comparative Evaluation of Feature Set Evolution Strategies for Multirelational Boosting. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 180--196. Springer-Verlag, 2003.
R.D. King. A Personal View of How Best to Apply ILP. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 1--1. Springer-Verlag, 2003.
M.-A. Krogel, S. Rawles, F. Zelezný, P.A. Flach, N. Lavrac, and S. Wrobel. Comparative Evaluation of Approaches to Propositionalization. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 197--214. Springer-Verlag, 2003.
F.A. Lisi and D. Malerba. Ideal Refinement of Descriptions in $\mathcalAL$-log. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 215--232. Springer-Verlag, 2003.
J.W. Lloyd. Agents that Reason and Learn. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 2--3. Springer-Verlag, 2003.
F.A. Marginean. Which First-Order Logic Clauses Can Be Learned Using Genetic Algorithms?. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 233--250. Springer-Verlag, 2003.
D. Mavroeidis and P.A. Flach. Improved Distances for Structured Data. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 251--268. Springer-Verlag, 2003.
S. Muggleton, A. Tamaddoni-Nezhad, and H. Watanabe. Induction of Enzyme Classes from Biological Databases. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 269--280. Springer-Verlag, 2003.
T. Oates, S. Doshi, and F. Huang. Estimating Maximum Likelihood Parameters for Stochastic Context-Free Graph Grammars. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 281--298. Springer-Verlag, 2003.
R.P. Otero. Induction of the Effects of Actions by Monotonic Methods. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 299--310. Springer-Verlag, 2003.
O. Ray, K. Broda, and A. Russo. Hybrid Abductive Inductive Learning: a Generalisation of Progol. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 311--328. Springer-Verlag, 2003.
J. Struyf and H. Blockeel. Query Optimization in Inductive Logic Programming by Reordering Literals. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 329--346. Springer-Verlag, 2003.
Y. Suzuki, T. Shoudai, S. Matsumoto, and T. Uchida. Efficient Learning of Unlabeled Term Trees with Contractible Variables from Positive Data. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 347--364. Springer-Verlag, 2003.
A. Tobudic and G. Widmer. Relational IBL in Music with a New Structural Similarity Measure. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 365--382. Springer-Verlag, 2003.
K. Yamagata, T. Uchida, T. Shoudai, and Y. Nakamura. An Effective Grammar-Based Compression Algorithm for Tree Structured Data. In T. Horváth and A. Yamamoto, editors, Proceedings of the 13th International Conference on Inductive Logic Programming, volume 2835 of Lecture Notes in Artificial Intelligence, pages 383--400. Springer-Verlag, 2003.