Name
Abstract | ||
|---|---|---|
Data mining over multiple data sources has become an important practical problem with applications in different areas. Although the data sources are willing to mine the union of their data, they don't want to reveal any sensitive and private information to other sources due to competition or legal concerns. In this paper, we consider two scenarios where data are vertically or horizontally partitioned over more than two parties. We focus on the classification problem, and present novel privacy preserving decision tree learning methods. Theoretical analysis and experiment results show that these methods can provide good capability of privacy preserving, accuracy and efficiency. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.4304/jcp.5.5.733-740 | JOURNAL OF COMPUTERS |
Keywords | Field | DocType |
Privacy Preserving, Data Mining, Decision Tree, Homomorphic encryption | Decision tree,Homomorphic encryption,Multiple data,Computer science,Artificial intelligence,Private information retrieval,Decision tree learning,Machine learning,Incremental decision tree | Journal |
Volume | Issue | ISSN |
5 | 5 | 1796-203X |
Citations | PageRank | References |
1 | 0.39 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weiwei Fang | 1 | 247 | 17.51 |
| Bingru Yang | 2 | 186 | 26.67 |
| Dingli Song | 3 | 1 | 0.73 |