Skip to Main content Skip to Navigation
Conference papers

A Graph Enrichment Based Clustering over Vertically Partitioned Data

Khalid Benabdeslem 1 Brice Effantin 2 Haytham Elghazel 1
1 DM2L - Data Mining and Machine Learning
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
2 GOAL - Graphes, AlgOrithmes et AppLications
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
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.
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01285352
Contributor : Brice Effantin Connect in order to contact the contributor
Submitted on : Wednesday, March 9, 2016 - 9:50:25 AM
Last modification on : Tuesday, June 1, 2021 - 2:08:09 PM

Links full text

Identifiers

Citation

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⟩

Share

Metrics

Record views

181