Home ›
Entities
› academia
› A Privacy-Preserving k-Means Clustering Algorithm Using Secure Comparison Protocol and Density-Based Center Point Selection
A Privacy-Preserving k-Means Clustering Algorithm Using Secure Comparison Protocol and Density-Based Center Point Selection
Research article (2018 IEEE 11th International Conference on Cloud Computing (CLOUD), 2018) · cited 17× · AI/ML
A Privacy-Preserving k-Means Clustering Algorithm Using Secure Comparison Protocol and Density-Based Center Point Selection
Summary
A Privacy-Preserving k-Means Clustering Algorithm Using Secure Comparison Protocol and Density-Based Center Point Selection is a scholarly article[1].
Key Facts
A Privacy-Preserving k-Means Clustering Algorithm Using Secure Comparison Protocol and Density-Based Center Point Selection's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). A Privacy-Preserving k-Means Clustering Algorithm Using Secure Comparison Protocol and Density-Based Center Point Selection. Retrieved May 24, 2026, from https://4ort.xyz/entity/a-privacy-preserving-k-means-clustering-algorithm-using-secure-comparison-protocol-and-density-based-center-point-select
MLA“A Privacy-Preserving k-Means Clustering Algorithm Using Secure Comparison Protocol and Density-Based Center Point Selection.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/a-privacy-preserving-k-means-clustering-algorithm-using-secure-comparison-protocol-and-density-based-center-point-select.
BibTeX@misc{4ortxyz_a-privacy-preserving-k-means-clustering-algorithm-using-secure-comparison-protocol-and-density-based-center-point-select_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{A Privacy-Preserving k-Means Clustering Algorithm Using Secure Comparison Protocol and Density-Based Center Point Selection}}, year = {2026}, url = {https://4ort.xyz/entity/a-privacy-preserving-k-means-clustering-algorithm-using-secure-comparison-protocol-and-density-based-center-point-select}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): A Privacy-Preserving k-Means Clustering Algorithm Using Secure Comparison Protocol and Density-Based Center Point Selection — https://4ort.xyz/entity/a-privacy-preserving-k-means-clustering-algorithm-using-secure-comparison-protocol-and-density-based-center-point-select (retrieved 2026-05-24)
