Fault tolerant secure K-means clustering data mining on semi-honest parties
This project report will discuss the design of secure fault tolerant k-means clustering data mining on semi-honest parties. The algorithm will protect all parties’ privacy while using caching and checkpointing to tolerate unexpected fault exceptions, such as party dies during processing. Sha...
Saved in:
Main Author: | Qian, Xiaofeng |
---|---|
Other Authors: | Ng Wee Keong |
Format: | Final Year Project |
Language: | English |
Published: |
2010
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/36286 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Fault tolerant privacy preseving decision tree induction
by: Herianto, Andre Ricardo.
Published: (2010) -
Oblivious NFA evaluation with an untrusted third party
by: Zhou, Haoran
Published: (2022) -
A study of some vulnerabilities in information security
by: Tan, Kevin Wei Loong
Published: (2021) -
Cloud security
by: Hein Htet, Zaw
Published: (2014) -
Security and privacy in social network
by: Mohammad Izzat Mohammad Noor
Published: (2014)