The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Privacy-preserving decision trees over vertically partitioned data
Abstract
Privacy and security concerns can prevent sharing of data, derailing data-mining projects. Distributed knowledge discovery, if done correctly, can alleviate this problem. We introduce a generalized privacy-preserving variant of the ID3 algorithm for vertically partitioned data distributed over two or more parties. Along with a proof of security, we discuss what would be necessary to make the protocols completely secure. We also provide experimental results, giving a first demonstration of the practical complexity of secure multiparty computation-based data mining.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335438 · Cited by 1,719 · cited 2×
“There has been growing interest in privacy-preserving data mining since the seminal papers in 2000 [ 1 , 2]. Classication is one of the most ubiquitous data mining problems found in real life.”
BackgroundPrivacy Preserving Data Mining
Lindell, Y., & Pinkas, B. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_3 · Cited by 1,077
Privacy preserving association rule mining in vertically partitioned data
Vaidya, J., & Clifton, C. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775142 · Cited by 1,001
Self-citationPrivacy-preserving k -means clustering over vertically partitioned data
Vaidya, J., & Clifton, C. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956776 · Cited by 626 · cited 2×
“…and Clifton [2002, 2004], EM clustering in horizontally partitioned data [Lin et al. 2005], K-means clustering in vertically partitioned data [Vaidya and Clifton 2003; Jagannathan and Wright 2005], association rules in vertically partitioned data Vaidya and Clifton [2005b, 2002], and…”
BackgroundMethodSelf-citationPrivacy-Preserving Decision Trees over Vertically Partitioned Data
Vaidya, J., & Clifton, C. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535706_11 · Cited by 144
Self-citation
Cited by
A survey on trust management for Internet of Things
Yan, Z., Zhang, P., & Vasilakos, A. V. (2014) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2014.01.014 · Cited by 1,155
“It is widely used in privacy preserving collaborative computation: privacy preserving computational geometry [44], privacy preserving statistic analysis [45], privacy preserving matrix computation [46], privacy preserving scientific computation [47], especially privacy preserving data mining [48-52].”
BackgroundPrivacy-preserving outsourced classification in cloud computing
Li, P., Li, J., Huang, Z., Gao, C.-Z., Chen, W.-B., & Chen, K. (2018) · Cluster Computing · doi:10.1007/s10586-017-0849-9 · Cited by 309
Challenges, Applications and Design Aspects of Federated Learning: A Survey
Rahman, K. M. J., Ahmed, F., Akhter, N., Hasan, M., Amin, R., Aziz, K. E., Islam, A. K. M. M., Mukta, M. S. H., & Islam, A. K. M. N. (2021) · IEEE Access · doi:10.1109/access.2021.3111118 · Cited by 147
Metadata
- Authors
- Vaidya, J., Clifton, C., Kantarcioglu, M., & Patterson, A. S.
- Venue
- ACM Transactions on Knowledge Discovery from Data
- Published
- 2008-10
- Volume
- 2
- Issue
- 3
- Pages
- 1-27
- ISSN
- 1556-4681 (ISSN-L)
- 1556-472X
- OpenAlex
- W2137596716
- Cited by
- 166
- References
- 7
- FWCI
- 12.72
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Privacy-preserving decision trees over vertically partitioned data. https://app.cochat.ai/papers/10.1145/1409620.1409624
- The paper
- Vaidya, J., Clifton, C., Kantarcioglu, M., & Patterson, A. S. (2008). Privacy-preserving decision trees over vertically partitioned data. ACM Transactions on Knowledge Discovery from Data. https://doi.org/10.1145/1409620.1409624
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.