کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
535789 | 870379 | 2012 | 8 صفحه PDF | دانلود رایگان |
Nowadays, the expansion of computer networks and the diversity of data sources require new data mining approaches in multi-database systems. We propose a classification approach across multiple heterogeneous relational databases. More specifically, given a set of inter-related databases, we use a regression model for predicting the most useful links that will be connected to build a multi-relational decision tree. Experiments performed on different real and synthetic databases were very satisfactory compared with previous classification approaches in multiple databases.
► We present a classification approach across multiple heterogeneous relational databases.
► We use a regression based SVM model for predicting the most useful links.
► Then, we perform a multi-relational decision tree classification algorithm.
► Experiments on real and synthetic databases were very satisfactory.
Journal: Pattern Recognition Letters - Volume 33, Issue 13, 1 October 2012, Pages 1768–1775