Please use this identifier to cite or link to this item:
|Title:||Fault tolerant secure K-means clustering data mining on semi-honest parties||Authors:||Qian, Xiaofeng||Keywords:||DRNTU::Engineering::Computer science and engineering::Data::Data encryption||Issue Date:||2010||Abstract:||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. Shair Secret Sharing Scheme and Secure Scalar Product will be used to maintain caching data. The algorithm fault tolerance threshold is (k, N), which means up to N-k parties dying is tolerable. Other different types of faults are also handled using different ways.||URI:||http://hdl.handle.net/10356/36286||Rights:||Nanyang Technological University||Fulltext Permission:||restricted||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SCSE Student Reports (FYP/IA/PA/PI)|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.