On the public citation graph

Privacy Preserving BIRCH Algorithm for Clustering over Vertically Partitioned Databases

0 signed · 36 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11496618_9openalex-snapshot
On Private Scalar Product Computation for Privacy-Preserving Data Mining
inferredcites →https://doi.org/10.1007/11555827_23openalex-snapshot
Privacy Preserving Clustering
inferredcites →https://doi.org/10.1007/3-540-44586-2_9openalex-snapshot
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System
inferredcites →https://doi.org/10.1007/3-540-44598-6_3openalex-snapshot
Privacy Preserving Data Mining
inferredcites →https://doi.org/10.1007/3-540-48910-x_16openalex-snapshot
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
inferredcites →https://doi.org/10.1016/0378-3758(89)90033-5openalex-snapshot
Algorithms for clustering data
inferredcites →https://doi.org/10.1016/b978-1-55558-334-7.x5000-2openalex-snapshot
Implementing Database Security and Auditing
inferredcites →https://doi.org/10.1080/00401706.1990.10484648openalex-snapshot
Algorithms for Clustering Data
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1982.88openalex-snapshot
Protocols for secure computations
inferredcites →https://doi.org/10.1109/sfcs.1986.25openalex-snapshot
How to generate and exchange secrets
inferredcites →https://doi.org/10.1137/1.9781611972764.47openalex-snapshot
A New Privacy-Preserving Distributed k-Clustering Algorithm
inferredcites →https://doi.org/10.1145/1081870.1081942openalex-snapshot
Privacy-preserving distributed k-means clustering over arbitrarily partitioned data
inferredcites →https://doi.org/10.1145/1150402openalex-snapshot
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
inferredcites →https://doi.org/10.1145/233269.233324openalex-snapshot
BIRCH
inferredcites →https://doi.org/10.1145/2339530openalex-snapshot
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
inferredcites →https://doi.org/10.1145/319709.319726openalex-snapshot
Efficient private bidding and auctions with an oblivious third party
inferredcites →https://doi.org/10.1145/335191.335438openalex-snapshot
Privacy-preserving data mining
inferredcites →https://doi.org/10.1145/375551.375602openalex-snapshot
On the design and quantification of privacy preserving data mining algorithms
inferredcites →https://doi.org/10.1145/775047.775142openalex-snapshot
Privacy preserving association rule mining in vertically partitioned data
inferredcites →https://doi.org/10.1145/956750.956776openalex-snapshot
Privacy-preserving k -means clustering over vertically partitioned data
inferredcites →https://doi.org/10.5753/jidm.2010.940openalex-snapshot
Privacy Preserving Clustering by Data Transformation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11844662openalex-snapshot
Secure Data Management
inferred← citeshttps://doi.org/10.1007/978-3-319-01778-5_16openalex-snapshot
A Secure Two Party Hierarchical Clustering Approach for Vertically Partitioned Data Set with Accuracy Measure
inferred← citeshttps://doi.org/10.1007/978-3-540-73871-8_15openalex-snapshot
Privacy Preserving BIRCH Algorithm for Clustering over Arbitrarily Partitioned Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-73871-8_7openalex-snapshot
Privacy Preserving DBSCAN Algorithm for Clustering
inferred← citeshttps://doi.org/10.1007/978-94-007-0641-5_19openalex-snapshot
Privacy-Preserving Data Mining from Outsourced Databases
inferred← citeshttps://doi.org/10.1016/j.datak.2010.02.009openalex-snapshot
Using ASP for knowledge management with user authorization
inferred← citeshttps://doi.org/10.1109/access.2021.3063131openalex-snapshot
Motion Recognition Based on Sum of the Squared Errors Distribution
inferred← citeshttps://doi.org/10.1109/ebiss.2009.5138025openalex-snapshot
Privacy Preserving Outlier Detection over Vertically Partitioned Data
inferred← citeshttps://doi.org/10.1109/eespe63401.2025.10987045openalex-snapshot
Research on Supermarket Customer Stratification Based on Improved RFMP Model and Integrated Learning
inferred← citeshttps://doi.org/10.1109/tii.2026.3662497openalex-snapshot
Achieving Secure and Efficient Clustering for Multiple Source Time Series Data in Industrial Internet of Things
inferred← citeshttps://doi.org/10.11591/ijai.v12.i4.pp1619-1627openalex-snapshot
Reducing the time needed to solve a traveling salesman problem by clustering with a Hierarchy-based algorithm
inferred← citeshttps://doi.org/10.2478/popets-2021-0068openalex-snapshot
SoK: Efficient Privacy-preserving Clustering
inferred← citeshttps://doi.org/10.32657/10356/41834openalex-snapshot
Privacy-preserving data mining via secure multiparty computation
inferred← citeshttps://doi.org/10.4236/jsea.2013.65b006openalex-snapshot
Privacy Preserving Two-Party Hierarchical Clustering Over Vertically Partitioned Dataset
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.