Abstract
Propositionalization has already been shown to be a promising approach for robustly and effectively handling relational data sets for knowledge discovery. In this paper, we compare up-to-date methods for propositionalization from two main groups: logic-oriented and database-oriented techniques. Experiments using several learning tasks – both ILP benchmarks and tasks from recent international data mining competitions – show that both groups have their specific advantages. While logic-oriented methods can handle complex background knowledge and provide expressive first-order models, database-oriented methods can be more efficient especially on larger data sets. Obtained accuracies vary such that a combination of the features produced by both groups seems a further valuable venture.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alphonse, E., Rouveirol, C.: Lazy propositionalisation for Relational Learning. In: Horn, W. (ed.) Proceedings of the Fourteenth European Conference on Artificial Intelligence (ECAI), pp. 256–260. IOS, Amsterdam (2000)
Berka, P.: Guide to the Financial Data Set. In: Siebes, A., Berka, P. (eds.) PKDD 2000 Discovery Challenge (2000)
Blockeel, H., De Raedt, L.: Top-down induction of first-order logical decision trees. Artificial Intelligence 101(1-2), 285–297 (1998)
Cheng, J., Hatzis, C., Hayashi, H., Krogel, M.-A., Morishita, S., Page, D., Sese, J.: KDD Cup 2001 Report. SIGKDD Explorations 3(2), 47–64 (2002)
Clark, P., Niblett, T.: The CN2 induction algorithm. Machine Learning 3, 261–283 (1989)
Cohen, W.W.: Fast effective rule induction. In: Prieditis, A., Russell, S. (eds.) Proceedings of the Twelfth International Conference on Machine Learning (ICML), pp. 115–123. Morgan Kaufmann, San Francisco (1995)
Flach, P.A.: Knowledge representation for inductive learning. In: Hunter, A., Parsons, S. (eds.) ECSQARU 1999. LNCS (LNAI), vol. 1638, pp. 160–167. Springer, Heidelberg (1999)
Flach, P.A., Lachiche, N.: 1BC: A first-order Bayesian classifier. In: Džeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol. 1634, pp. 92–103. Springer, Heidelberg (1999)
Knobbe, A.J., de Haas, M., Siebes, A.: Propositionalisation and Aggregates. In: Siebes, A., De Raedt, L. (eds.) PKDD 2001. LNCS (LNAI), vol. 2168, pp. 277–288. Springer, Heidelberg (2001)
Kramer, S., Frank, E.: Bottom-up propositionalization. In: Work-in-Progress Track at the Tenth International Conference on Inductive Logic Programming, ILP (2000)
Kramer, S., Lavrač, N., Flach, P.A.: Propositionalization Approaches to Relational Data Mining. In: Lavrač, N., Džeroski, S. (eds.) Relational Data Mining, pp. 262–291. Springer, Heidelberg (2001)
Krogel, M.-A., Wrobel, S.: Transformation-Based Learning Using Multirelational Aggregation. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol. 2157, pp. 142–155. Springer, Heidelberg (2001)
Lavrač, N., Džeroski, S.: Inductive Logic Programming: Techniques and Applications. Ellis Horwood (1994)
Lavrač, N., Flach, P.A.: An extended transformation approach to Inductive Logic Programming. ACM Transactions on Computational Logic 2(4), 458–494 (2001)
Lavrač, N., Flach, P.A., Kavšek, B., Todorovski, L.: Adapting classification rule induction to subgroup discovery. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM), pp. 266–273. IEEE, Los Alamitos (2002)
Lavrač, N., Gamberger, D., Turney, P.: A relevancy filter for constructive induction. IEEE Intelligent Systems 13(2), 50–56 (1998)
Lavrač, N., Železný, F., Flach, P.A.: RSD: Relational subgroup discovery through first-order feature construction. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol. 2583, pp. 149–165. Springer, Heidelberg (2003)
Michalski, R.S.: Pattern Recognition as Rule-guided Inference. IEEE Transactions on Pattern Analysis and Machine Intelligence 2(4), 349–361 (1980)
Muggleton, S.: Inverse entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming 13(3-4), 245–286 (1995)
Quinlan, J.R.: Learning logical definitions from relations, vol. 5, pp. 239–266 (1990)
Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)
Srinivasan, A., King, R.D.: Feature construction with inductive logic programming: A study of quantitative predictions of biological activity aided by structural attributes. In: ILP 1996. LNCS (LNAI), vol. 1314, pp. 89–104. Springer, Heidelberg (1997)
Srinivasan, A., Muggleton, S.H., Sternberg, M.J.E., King, R.: Theories for mutagenicity: A study in first-order and feature-based induction. Artificial Intelligence 85(1,2), 277–299 (1996)
Witten, I.H., Frank, E.: Data Mining – Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann, San Francisco (2000)
Wrobel, S.: An algorithm for multi-relational discovery of subgroups. In: Komorowski, J., Żytkow, J.M. (eds.) PKDD 1997. LNCS (LNAI), vol. 1263, pp. 78–87. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krogel, MA., Rawles, S., Železný, F., Flach, P.A., Lavrač, N., Wrobel, S. (2003). Comparative Evaluation of Approaches to Propositionalization. In: Horváth, T., Yamamoto, A. (eds) Inductive Logic Programming. ILP 2003. Lecture Notes in Computer Science(), vol 2835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39917-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-39917-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20144-1
Online ISBN: 978-3-540-39917-9
eBook Packages: Springer Book Archive