Name
Abstract | ||
|---|---|---|
This paper studies a privacy-preserving decision tree learning protocol (PPDT) for vertically partitioned datasets. In the vertically partitioned datasets, a single class (target) attribute are shared by both parities or carefully treated by either party in the existing studies. The proposed scheme allows both parties to have independent class attributes in secure way and to combine multiple class attributes in arbitrary boolean function, which gives parties a flexibility in data-mining. Our proposed PPDT protocol reduces the CPU intensive computation of logarithm by approximating with the piecewise linear function defined by light-weight fundamental operations of addition and constant-multiplication so that information gain for attribute can be evaluated in the secure function evaluation scheme. Using the UCI Machine Learning dataset and the synthesized dataset, the proposed protocol is evaluated in terms of the accuracy and the size of tree. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/AINA.2013.140 | Advanced Information Networking and Applications |
Keywords | Field | DocType |
Boolean functions,cryptographic protocols,data mining,data privacy,decision trees,function approximation,function evaluation,learning (artificial intelligence),PPDT learning protocol,UCI machine learning dataset,addition operation,arbitrary Boolean function class attributes,constant-multiplication operation,data-mining,function evaluation scheme,information gain,logarithm CPU intensive computation reduction,piecewise linear function approximating,privacy-preserving decision tree learning protocol,single-class target attribute sharing,synthesized dataset,vertically partitioned datasets,data mining,decision tree,privacy | Boolean function,Decision tree,Data mining,Function approximation,Cryptographic protocol,Computer science,Theoretical computer science,ID3 algorithm,Piecewise linear function,Decision tree learning,Incremental decision tree | Conference |
ISSN | ISBN | Citations |
1550-445X E-ISBN : 978-0-7695-4953-8 | 978-0-7695-4953-8 | 2 |
PageRank | References | Authors |
0.43 | 4 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kikuchi, H. | 1 | 2 | 0.43 |
| Ito, K. | 2 | 66 | 19.68 |
| Ushida, M. | 3 | 3 | 0.80 |
| Tsuda, H. | 4 | 2 | 0.77 |