Open Access Open Access  Restricted Access Subscription or Fee Access

Comprehensive and Evolution Study Focusing Future Research Challenges in the Field of Multi Relational Data Mining Specific to Multi-Relational Classification Approaches

Amit Thakkar, Y.P. Kosta


Most of today’s structured data is stored in relational databases. Thus, the task of learning from relational data has begun to receive significant attention in the literature. Unfortunately, most methods only utilize “flat” data representations. Thus, to apply these single-table data mining techniques, we are forced to incur a computational penalty by first converting the data into this “flat” form. As a result of this transformation, the data not only loses its compact representation but the semantic information present in the relations are reduced or eliminated. As an important task of multi- relational data mining, multi-relational classification can directly look for patterns that involve multiple relations from a relational database and have more advantages than propositional data mining approaches. According to the differences in knowledge representation and strategy, the paper addressed different kind of multi-relational classification approaches that are ILP- based, graph-based and relational database-based classification approaches and discussed each relational classification technology, their characteristics, the comparisons and several challenging researching problems in detail.


Multi-Relational Data Mining, Multi-Relational Classification, Inductive Logic Programming ILP), Graph, Selection Graph, Tuple ID Propagation

Full Text:



Han Jiawei, M. Kamber. Data Mining: Concepts andTechniques, Second Edition .Morgan Kauf mann, 2007

S. Dzeroski, N. Lavrac eds. Relational data mining. Berlin:Springer, 2001

He J, Liu HY, Du XY. Mining of multi-relational association rules. Journal of Software, 2007,18(11): 2752-2765.

A. J. Knobbe. Multi-Relational Data Mining. Utrecht University,2004

S. Dzeroski. Multi-relational data mining: an introduction[J].SIGKDD Explorations, 2003, 5(1):1-16

S. Wrobel. Inductive Logic Programming for Knowledge Discovery in Databases. Relational Data Mining, Berlin: Springer, 2001:74-101

A. Woznica, A. Kalousis, and M. Hilario. Kernel-based distances for relational learning. In Proceedings of the Workshop on Multi- Relational Data Mining at KDD-2004, 2004.

L. Getoor, N. Friedman, D. Koller, and A. Pfeffer. Learning Probabilistic Relational Models. In [2], 2001: 307-335

D. Cook and L. Holder. Graph-based data mining. IEEE Intelligent Systems, 15(2):32-41, 2000

J. Knobbe, H. Blockeel, A. Siebes, et al. Multi-relational Data Mining. In Proceedings of Benelearn’99 ,1999

H. A. Leiva. A multi-relational decision tree learning algorithm. Deparment of Computer Science, Iowa State University, 2002

C. L. Curotto ,N. F. F. Ebecken, H. Blockeel. Multi-relational data mining in Microsoft SQL Server, In Seventh International Conference on Data, Text and Web Mining and their Business Applications, Prague, Tsjechie, July, 2006

A.Atramentov, H. Leiva, and V.Honavar. A Multi-relational Decision Tree Learning Algorithm - Implementation and Experiments. Springer-Verlag Berlin Heidelberg, 2003: 38–56

Hongyan Liu, Xiaoxin Yin, Jiawei Han. An Efficient Multi-relational Naive Bayesian Classifier Based on Semantic Relationship Graph. In Proceedings of the 4th International Workshop on Multi-Relational Data Mining.Chicago, IL, 2005:68-76.

Zhen Peng, Lifeng Wu, Xiaoju Wang, Research on Multi-Relational Classification Approaches, 2009 International Conference on Computational Intelligence and Natural Computing.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.