On the public citation graph
Multi-party k-Means Clustering with Privacy Consideration
0 signed · 70 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.
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.
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/11535706_12openalex-snapshot
Privacy-Preserving Collaborative Association Rule Mining
inferredcites →https://doi.org/10.1007/11539827_12openalex-snapshot
Privacy-Preserving Collaborative Data Mining
inferredcites →https://doi.org/10.1007/11593447_13openalex-snapshot
Privacy-Preserving Graph Algorithms in the Semi-honest Model
inferredcites →https://doi.org/10.1007/3-540-28349-8_2openalex-snapshot
A Survey of Clustering Data Mining Techniques
inferredcites →https://doi.org/10.1007/3-540-44598-6_3openalex-snapshot
Privacy Preserving Data Mining
inferredcites →https://doi.org/10.1007/3-540-46502-2_13openalex-snapshot
A Data-Clustering Algorithm on Distributed Memory Multiprocessors
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.1007/978-3-642-00202-1_24openalex-snapshot
The Planar k-Means Problem is NP-Hard
inferredcites →https://doi.org/10.1007/s000370050019openalex-snapshot
Quantifying knowledge complexity
inferredcites →https://doi.org/10.1007/s10994-009-5103-0openalex-snapshot
NP-hardness of Euclidean sum-of-squares clustering
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1016/c2009-0-27872-xopenalex-snapshot
Introduction to Statistical Pattern Recognition
inferredcites →https://doi.org/10.1016/j.comgeo.2004.03.003openalex-snapshot
A local search approximation algorithm for k-means clustering
inferredcites →https://doi.org/10.1016/j.datak.2007.03.015openalex-snapshot
Privacy preserving clustering on horizontally partitioned data
inferredcites →https://doi.org/10.1016/j.tcs.2010.05.034openalex-snapshot
The planar k -means problem is NP-hard
inferredcites →https://doi.org/10.1023/b:mach.0000033113.59016.96openalex-snapshot
Clustering Large Graphs via the Singular Value Decomposition
inferredcites →https://doi.org/10.1109/focs.2004.7openalex-snapshot
A Simple Linear Time (1+ ∊) -Approximation Algorithm for k-Means Clustering in Any Dimensions
inferredcites →https://doi.org/10.1109/focs.2006.75openalex-snapshot
The Effectiveness of Lloyd-Type Methods for the k-Means Problem
inferredcites →https://doi.org/10.1109/isi.2007.379472openalex-snapshot
Privacy Preserving Collaborative Data Mining
inferredcites →https://doi.org/10.1109/sfcs.1982.38openalex-snapshot
Protocols for secure computations
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.1109/tit.1982.1056489openalex-snapshot
Least squares quantization in PCM
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/1315245.1315306openalex-snapshot
Secure two-party k-means clustering
inferredcites →https://doi.org/10.1145/177424.178042openalex-snapshot
Applications of weighted Voronoi diagrams and randomization to variance-based k -clustering
inferredcites →https://doi.org/10.1145/513400.513402openalex-snapshot
A local search approximation algorithm for k-means clustering
inferredcites →https://doi.org/10.1145/775047.775142openalex-snapshot
Privacy preserving association rule mining in vertically partitioned data
inferredcites →https://doi.org/10.1145/780542.780550openalex-snapshot
Approximation schemes for clustering problems
inferredcites →https://doi.org/10.1145/956750.956776openalex-snapshot
Privacy-preserving k -means clustering over vertically partitioned data
inferredcites →https://doi.org/10.2307/1573081openalex-snapshot
Pattern Classification and Scene Analysis
inferredcites →https://doi.org/10.5555/1283383.1283494openalex-snapshot
k-means++: the advantages of careful seeding
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nem.2139openalex-snapshot
Secure grid‐based density peaks clustering on hybrid cloud for industrial IoT
inferred← citeshttps://doi.org/10.1007/978-3-030-00202-2_19openalex-snapshot
Privacy Preserving Collaborative Fuzzy Co-clustering of Three-Mode Cooccurrence Data
inferred← citeshttps://doi.org/10.1007/978-3-030-05171-6_10openalex-snapshot
Privacy Preserving Multi-server k-means Computation over Horizontally Partitioned Data
inferred← citeshttps://doi.org/10.1007/978-3-030-22574-2_5openalex-snapshot
Collaborative Framework for Fuzzy Co-clustering
inferred← citeshttps://doi.org/10.1007/978-3-030-22574-2_6openalex-snapshot
Three-Mode Fuzzy Co-clustering and Collaborative Framework
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-981-10-3773-3_58openalex-snapshot
Implementation of Modified K-means Approach for Privacy Preserving in Data Mining
inferred← citeshttps://doi.org/10.1007/s12083-020-00881-xopenalex-snapshot
Privacy-preserving k-means clustering with local synchronization in peer-to-peer networks
inferred← citeshttps://doi.org/10.1016/j.future.2020.07.023openalex-snapshot
A new data clustering strategy for enhancing mutual privacy in healthcare IoT systems
inferred← citeshttps://doi.org/10.1016/j.procs.2021.08.047openalex-snapshot
Fuzzy c-Varieties Clustering for Vertically Distributed Datasets
inferred← citeshttps://doi.org/10.1109/ccwc47524.2020.9031152openalex-snapshot
Healthcare Yelp: Health Care Services Prediction
inferred← citeshttps://doi.org/10.1109/ccwc47524.2020.9031256openalex-snapshot
A Study of Ensemble Methods for Cyber Security
inferred← citeshttps://doi.org/10.1109/compsacw.2013.53openalex-snapshot
Privacy-Preserving Two-Party k-Means Clustering in Malicious Model
inferred← citeshttps://doi.org/10.1109/fuzz-ieee.2014.6891746openalex-snapshot
Fuzzy co-clustering of vertically partitioned cooccurrence data with privacy consideration
inferred← citeshttps://doi.org/10.1109/fuzz-ieee.2018.8491464openalex-snapshot
Fuzzy Clustering based Anomaly Detection for Distributed Multi-view Data
inferred← citeshttps://doi.org/10.1109/icbk.2019.00021openalex-snapshot
Machine Learning Models for Paraphrase Identification and its Applications on Plagiarism Detection
inferred← citeshttps://doi.org/10.1109/icce.2019.8662011openalex-snapshot
Deep Learning Based Shopping Assistant For The Visually Impaired
inferred← citeshttps://doi.org/10.1109/icce.2019.8662028openalex-snapshot
T-RECSYS: A Novel Music Recommendation System Using Deep Learning
inferred← citeshttps://doi.org/10.1109/iucc/dsci/smartcns.2019.00112openalex-snapshot
A Data Clustering Strategy for Enhancing Mutual Privacy in Healthcare System of IoT
inferred← citeshttps://doi.org/10.1109/scis-isis.2014.7044660openalex-snapshot
Privacy preserving fuzzy co-clustering with distributed cooccurrence matrices
inferred← citeshttps://doi.org/10.1109/scisisis55246.2022.10002099openalex-snapshot
Fuzzy c-Lines for Vertically Distributed Database with Missing Values
inferred← citeshttps://doi.org/10.1109/taai.2015.7407056openalex-snapshot
Fuzzy co-clustering considering site-wise confidence of vertically partitioned cooccurrence data
inferred← citeshttps://doi.org/10.1109/tii.2017.2695487openalex-snapshot
Mutual Privacy Preserving $k$ -Means Clustering in Social Participatory Sensing
inferred← citeshttps://doi.org/10.1155/2015/729072openalex-snapshot
A Collaborative Framework for Privacy Preserving Fuzzy Co-Clustering of Vertically Distributed Cooccurrence Matrices
inferred← citeshttps://doi.org/10.2478/popets-2021-0068openalex-snapshot
SoK: Efficient Privacy-preserving Clustering
inferred← citeshttps://doi.org/10.3156/jsoft.33.2_600openalex-snapshot
Linear Fuzzy Clustering of Distributed Databases Considering Privacy Preservation
inferred← citeshttps://doi.org/10.4236/jsea.2013.65b006openalex-snapshot
Privacy Preserving Two-Party Hierarchical Clustering Over Vertically Partitioned Dataset
inferred← citeshttps://doi.org/10.48550/arxiv.2009.10453openalex-snapshot
Privacy Preserving K-Means Clustering: A Secure Multi-Party Computation Approach
inferred← citeshttps://doi.org/10.5121/ijdkp.2017.7303openalex-snapshot
Two Party Hierarichal Clustering Over Horizontally Partitioned Data Set
inferred← citeshttps://doi.org/10.57709/4829222openalex-snapshot
A Classification Framework for Imbalanced Data
inferred← citeshttps://doi.org/10.5815/ijeme.2018.04.06openalex-snapshot
An Intelligent Distributed K-means Algorithm over Cloudera /Hadoop
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.