Abstract
Restricting the form of rules is an important issue of relational association rule mining. The proposing method PIX extracts properties from given examples and to use them to form rules. An property of an instance consists of an addressing part which specifies objects related to the instance and description part which says something among the objects. Extracted properties are used like as an item in market basket database and an APRIORI-like algorithm calculates frequent item sets. The paper describes also an experiment in a sample application.
Keywords
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
Agrawal, R., Imielinski, T., Swami, N.A.: Mining association rules between sets of items in large database. In: Proc. SIGMOD, pp. 207–216. ACM Press, New York (1993)
Dehaspe, L., De Raedt, L.: Mining association rules with multiple relations. In: Proceedings of the 7th International Workshop on Inductive Logic Programming, pp. 125–132 (1997)
Dehaspe, L., Toivonen, H.: Discovery of Relational Association Rules. In: Relational Data Mining, pp. 189–212. Springer, Heidelberg (2001)
Furusawa, M., Inuzuka, N., Seki, H., Itoh, H.: Induction of Logic Programs with More Than One Recursive Clause by Analysing Saturations. In: Džeroski, S., Lavrač, N. (eds.) ILP 1997. LNCS (LNAI), vol. 1297, pp. 165–172. Springer, Heidelberg (1997)
Goethals, B., Van den Bussche, J.: Relational Association Rules: Getting WARM ER. In: Hand, D.J., Adams, N.M., Bolton, R.J. (eds.) Pattern Detection and Discovery. LNCS (LNAI), vol. 2447, pp. 125–139. Springer, Heidelberg (2002)
Michalski, R.S., Larson, J.B.: Inductive Inference of VL decision rules. In: Workshop in pattern-Directed Inference Systems, Hawaii, SIGART Newsletter, vol. 63, pp. 38–44. ACM, New York (1977)
Nijssen, S., Kok, J.N.: Efficient Frequent Query Discovery in Farmer. In: Lavrač, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol. 2838, pp. 350–362. Springer, Heidelberg (2003)
De Raedt, L., Blockeel, H., Dehaspe, L., Van Laer, W.: Three Companions for Data Mining in First Order Logic. In: Relational Data Mining, pp. 105–139. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Inuzuka, N., Motoyama, Ji., Nakano, T. (2006). Relational Association Mining Based on Structural Analysis of Saturation Clauses. In: Gabrys, B., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2006. Lecture Notes in Computer Science(), vol 4252. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11893004_147
Download citation
DOI: https://doi.org/10.1007/11893004_147
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46537-9
Online ISBN: 978-3-540-46539-3
eBook Packages: Computer ScienceComputer Science (R0)