Knowledge discovery from semantically heterogeneous aggregate databases using model-based clustering

Authors:
Shuai Zhang;Sally McClean;Bryan Scotney
Affiliations:
School of Computing and Information Engineering, University of Ulster, Coleraine, Northern Ireland, UK;School of Computing and Information Engineering, University of Ulster, Coleraine, Northern Ireland, UK;School of Computing and Information Engineering, University of Ulster, Coleraine, Northern Ireland, UK
Venue:
BNCOD'07 Proceedings of the 24th British national conference on Databases
Year:
2007

Citing 5
Cited 0

Aggregation of Imprecise and Uncertain Information in Databases

IEEE Transactions on Knowledge and Data Engineering
A Scalable Approach to Integrating Heterogeneous Aggregate Views of Distributed Databases

IEEE Transactions on Knowledge and Data Engineering
Clustering classifiers for knowledge discovery from physically distributed databases

Data & Knowledge Engineering
Knowledge discovery by probabilistic clustering of distributed databases

Data & Knowledge Engineering
Semantic-integration research in the database community

AI Magazine - Special issue on semantic integration

Quantified Score

Hi-index	0.00

Visualization

Abstract

When distributed databases are developed independently, they may be semantically heterogeneous with respect to data granularity, scheme information and the embedded semantics. However, most traditional distributed knowledge discovery (DKD) methods assume that the distributed databases derive from a single virtual global table, where they share the same semantics and data structures. This data heterogeneity and the underlying semantics bring a considerable challenge for DKD. In this paper, we propose a model-based clustering method for aggregate databases, where the heterogeneous schema structure is due to the heterogeneous classification schema. The underlying semantics can be captured by different clusters. The clustering is carried out via a mixture model, where each component of the mixture corresponds to a different virtual global table. An advantage of our approach is that the algorithm resolves the heterogeneity as part of the clustering process without previously having to homogenise the heterogeneous local schema to a shared schema. Evaluation of the algorithm is carried out using both real and synthetic data. Scalability of the algorithm is tested against the number of databases to be clustered; the number of clusters; and the size of the databases. The relationship between performance and complexity is also evaluated. Our experiments show that this approach has good potential for scalable integration of semantically heterogeneous databases.