Decision-Tree Model Research Based on Privacy-Preserving
Wei Fang · 2010
How to realize privacy-preserving data mining becomes a research hotspot in a distributed environment.A model is proposed to realize privacy-preserving decision-tree classifying when data are vertically partitioned.In this model,a privacy-preserving decision-tree is proposed,which is composed of Global-Table stored by an obvious semi-honest partner and several local decision-trees stored by different sites.By using indexed array and private data comparison protocol,decision-tree generation and classification can be realized without uncovering the original information.Theoretical analysis and experimental results demonstrate the proposed model provides good capabilities of privacies preserving,accuracy and efficiency.