Abstract
Most of today’s structured data is stored in relational data- bases. Such a database consists of multiple relations that are linked together conceptually via entity-relationship links in the design of relational database schemas. Multi-relational classification can be widely used in many disciplines including financial decision making and medical research. However, most classification approaches only work on single “flat” data relations. It is usually difficult to convert multiple relations into a single flat relation without either introducing huge “universal relation” or losing essential information. Previous works using Inductive Logic Programming approaches (recently also known as Relational Mining) have proven effective with high accuracy in multi-relational classification. Unfortunately, they fail to achieve high scalability w.r.t. the number of relations in databases because they repeatedly join different relations to search for good literals.
In this paper we propose CrossMine, an efficient and scalable approach for multi-relational classification. CrossMine employs tuple ID propagation, a novel method for virtually joining relations, which enables flexible and efficient search among multiple relations. CrossMine also uses aggregated information to provide essential statistics for classification. A selective sampling method is used to achieve high scalability w.r.t. the number of tuples in the databases. Our comprehensive experiments on both real and synthetic databases demonstrate the high scalability and accuracy of CrossMine.
The work was supported in part by National Science Foundation under Grants IIS-02-09199/IIS-03-08215, and an IBM Faculty Award. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the funding agencies.
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
Appice, A., Ceci, M., Malerba, D.: Mining model trees: a multi-relational approach. In: Horváth, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol. 2835, pp. 4–21. Springer, Heidelberg (2003)
Aronis, J.M., Provost, F.J.: Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation. In: Proc. 2003 Int. Conf. Knowledge Discovery and Data Mining, Newport Beach, CA (1997)
Blockeel, H., De Raedt, L., Ramon, J.: Top-down induction of logical decision trees. In: Proc. 1998 Int. Conf. Machine Learning, Madison, WI (August 1998)
Blockeel, H., De Raedt, L., Jacobs, N., Demoen, B.: Scaling up inductive logic programming by learning from interpretations. Data Mining and Knowledge Discovery 3(1), 59–93 (1999)
Blockeel, H., Dehaspe, L., Demoen, B., Janssens, G., Ramon, J., Vandecasteele, H.: Improving the efficiency of inductive logic programming through the use of query packs. Journal of Artificial Intelligence Research 16, 135–166 (2002)
Burges, C.J.C.: A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery 2, 121–168 (1998)
Clark, P., Boswell, R.: Rule induction with CN2: Some recent improvements. In: Proc. 1991 European Working Session on Learning, pp. 151–163. Porto, Portugal (March 1991)
Garcia-Molina, H., Ullman, J.D., Widom, J.: Database Systems: The Complete Book. Prentice-Hall, Englewood Cliffs (2002)
Gehrke, J., Ramakrishnan, R., Ganti, V.: Rainforest: A framework for fast decision tree construction of large datasets. In: Proc. 1998 Int. Conf. Very Large Data Bases, New York (August 1998)
Lavrac, N., Dzeroski, S.: Inductive Logic Programming: Techniques and Applications. Ellis Horwood (1994)
Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)
Muggleton, S.: Inductive Logic Programming. Academic Press, New York (1992)
Muggleton, S.: Inverse entailment and progol. In: New Generation Computing. Special issue on Inductive Logic Programming (1995)
Muggleton, S., Feng, C.: Efficient induction of logic programs. In: Proc. 1990 Conf. Algorithmic Learning Theory, Tokyo, Japan (1990)
Neville, J., Jensen, D., Friedland, L., Hay, M.: Learning Relational Probability Trees. In: Proc. 2003 Int. Conf. Knowledge Discovery and Data Mining, Washtington, DC (2003)
Popescul, A., Ungar, L., Lawrence, S., Pennock, M.: Towards structural logistic regression: Combining relational and statistical learning. In: Proc. Multi-Relational Data Mining Workshop, Alberta, Canada (2002)
Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)
Quinlan, J.R., Cameron-Jones, R.M.: FOIL: A midterm report. In: Proc. 1993 European Conf. Machine Learning, Vienna, Austria (1993)
Taskar, B., Segal, E., Koller, D.: Probabilistic classification and clustering in relational data. In: Proc. 2001 Int. Joint Conf. Artificial Intelligence, Seattle, WA (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
Yin, X., Han, J., Yang, J., Yu, P.S. (2006). CrossMine: Efficient Classification Across Multiple Database Relations. In: Boulicaut, JF., De Raedt, L., Mannila, H. (eds) Constraint-Based Mining and Inductive Databases. Lecture Notes in Computer Science(), vol 3848. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11615576_9
Download citation
DOI: https://doi.org/10.1007/11615576_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31331-1
Online ISBN: 978-3-540-31351-9
eBook Packages: Computer ScienceComputer Science (R0)