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. © 2011 Springer-Verlag.
CITATION STYLE
Benabdeslem, K., Effantin, B., & Elghazel, H. (2011). A graph enrichment based clustering over vertically partitioned data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7120 LNAI, pp. 42–54). https://doi.org/10.1007/978-3-642-25853-4_4
Mendeley helps you to discover research relevant for your work.