Salim Miloudi, Sid Ahmed Rahal, Salim Khiat, Journal of Information Processing Systems Vol. 14, No. 3, pp. 709-726, Jun. 2018  

https://doi.org/10.3745/JIPS.04.0075
Keywords: Connected Components, Database Classification, Graph-Based Algorithm, Multi-Database Mining
Fulltext: PDF Full Text PubReader

Abstract

Database classification is an important preprocessing step for the multi-database mining (MDM). In fact, when a multi-branch company needs to explore its distributed data for decision making, it is imperative to classify these multiple databases into similar clusters before analyzing the data. To search for the best classification of a set of n databases, existing algorithms generate from 1 to (n2–n)/2 candidate classifications. Although each candidate classification is included in the next one (i.e., clusters in the current classification are subsets of clusters in the next classification), existing algorithms generate each classification independently, that is, without taking into account the use of clusters from the previous classification. Consequently, existing algorithms are time consuming, especially when the number of candidate classifications increases. To overcome the latter problem, we propose in this paper an efficient approach that represents the problem of classifying the multiple databases as a problem of identifying the connected components of an undirected weighted graph. Theoretical analysis and experiments on public databases confirm the efficiency of our algorithm against existing works and that it overcomes the problem of increase in the execution time.

Statistics
Cite this article