A Graph Enrichment Based Clustering over Vertically Partitioned Data - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

A Graph Enrichment Based Clustering over Vertically Partitioned Data

Khalid Benabdeslem
Brice Effantin
Haytham Elghazel

Abstract

Several researchers have illustrated that data privacy is an important and inevitable constraint when dealing with distributed knowledge discovery. The challenge is to obtain valid results while preserving this property in each related party. In this paper, we propose a new approach based on enrichment of graphs where each party does the cluster of each entity (instance), but does nothing about the attributes (features or variables) of the other parties. Furthermore, no information is given about the clustering algorithms which provide the different partitions. Finally, experiment results are provided for validating our proposal over some known data sets.

Dates and versions

hal-01285352 , version 1 (09-03-2016)

Identifiers

Cite

Khalid Benabdeslem, Brice Effantin, Haytham Elghazel. A Graph Enrichment Based Clustering over Vertically Partitioned Data. 7th International Conference on Advanced Data Mining and Applications (ADMA 2011), Dec 2011, Beijing, China. pp.42-54, ⟨10.1007/978-3-642-25853-4_4⟩. ⟨hal-01285352⟩
70 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More