Abstract
The fact that data is scattered over many tables causes many problems in the practice of data mining. To deal with this problem, one either constructs a single table by hand, or one uses a Multi-Relational Data Mining algorithm. In this paper, we propose a different approach in which the single table is constructed automatically using aggregate functions, which repeatedly summarise information from different tables over associations in the datamodel. Following the construction of the single table, we apply traditional data mining algorithms. Next to an in-depth discussion of our approach, the paper presents results of experiments on three well-known data sets.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Alphonse, É., Rouveirol, C. Selective Propositionalization for Relational Learning, In Proceedings of PKDD’ 99, 1999
Dehaspe, L., Toivonen, H., Discovery of frequent Datalog patterns, Data Mining and Knowledge Discovery 3(1), 1999
Dietterich, T.G., Lathrop, R.H., Lozano-Pérez, T., Solving the multiple-instance problem with axis-parallel rectangles, Artificial Intelligence, 89(1–2):31–71, 1997
Džeroski, S., Blockeel, H., Kompare, B., Kramer, S., Pfahringer, B., Van Laer, W., Experiments in Predicting Biodegradability, In Proceedings of ILP’ 99, 1999
Friedman, N., Getoor, L., Koller, D., Pfeffer, A., Learning Probabilistic Relational Models, In Proceedings of IJCAI’ 99, 1999
Kramer, S., Relational Learning vs. Propositionalization, Ph.D thesis, 1999
Kramer, S., Pfahringer, B., Helma, C., Stochastic Propositionalization of non-determinate background knowledge, In Proceedings of ILP’ 98, 1998
Knobbe, A.J., Blockeel, H., Siebes, A., Van der Wallen, D.M.G. Multi-Relational Data Mining, In Proceedings of Benelearn’ 99, 1999
Knobbe, A.J., Siebes, A., Blockeel, H., Van der Wallen, D.M.G., Multi-Relational Data Mining, using UML for ILP, In Proceedings of PKDD 2000, 2000
Lavrač, N., Džeroski, S., Grobelnik, M., Learning nonrecursive definitions of relations with LINUS, In Proceedings of EWSL’91, 1991
Srinivasan, A., King, R.D., Feature construction with ILP: a study of quantitative predictions of biological activity by structural attributes, In Proceedings of ILP’ 96, 1996
Srinivasan, A., King, R.D., Bristol, D.W., An Assessment of ILP-Assisted Models for Toxicology and the PTE-3 Experiment, In Proceedings of ILP’ 99, 1999
Todorovski, L., Džeroski, S., Experiments in Meta-level Learning with ILP, In Proceedings of PKDD’ 99, 1999
Workshop notes on Discovery Challenge PKDD’ 99, 1999
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Knobbe, A.J., de Haas, M., Siebes, A. (2001). Propositionalisation and Aggregates. In: De Raedt, L., Siebes, A. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 2001. Lecture Notes in Computer Science(), vol 2168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44794-6_23
Download citation
DOI: https://doi.org/10.1007/3-540-44794-6_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42534-2
Online ISBN: 978-3-540-44794-8
eBook Packages: Springer Book Archive