A method for aggregating partitions, applications in K.D.D.

Authors:
Pierre-Emmanuel Jouve;Nicolas Nicoloyannis
Affiliations:
Laboratoire Eric, Equipe de Recherche en Ingénierie des Connaissances, Université Lumière-Lyon2, Bron Cedex, France;Laboratoire Eric, Equipe de Recherche en Ingénierie des Connaissances, Université Lumière-Lyon2, Bron Cedex, France
Venue:
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
Year:
2003

Citing 2
Cited 1

A cutting plane algorithm for a clustering problem

Mathematical Programming: Series A and B
Resampling Method for Unsupervised Estimation of Cluster Validity

Neural Computation

Clustering-based materialized view selection in data warehouses

ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

K.D.D. (Knowledge Discovery in Databases) methods and methodologies nearly all imply the retrieval of one or several structures of a data set. In practice, using those methods may give rise to a bunch of problems (excessive computing time, parameters settings, ...). We show in this paper that some of these problems can be solved via the construction of a global structure starting from a set of sub-structures. We thus propose a method for aggregating a set of partial structures into a global one and then present how this method can be used for solving several traditional practical problems of K.D.D.