A Secure Clustering Algorithm for Distributed Data Streams

I
ICDMW
2007
Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007)
Abstract - A Secure Clustering Algorithm for Distributed Data Streams

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Geetha Jagannathan Articles by Krishnan Pillaipakkamnatt Articles by D. Umano

Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007)

Omaha, Nebraska, USA

October 28-October 31

ISBN: 0-7695-3033-8

	ASCII Text	x
	Geetha Jagannathan, Krishnan Pillaipakkamnatt, D. Umano, "A Secure Clustering Algorithm for Distributed Data Streams," Data Mining Workshops, International Conference on, pp. 705-710, Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007), 2007.

	BibTex	x
	@article{ 10.1109/ICDMW.2007.65, author = {Geetha Jagannathan and Krishnan Pillaipakkamnatt and D. Umano}, title = {A Secure Clustering Algorithm for Distributed Data Streams}, journal ={Data Mining Workshops, International Conference on}, volume = {0}, year = {2007}, isbn = {0-7695-3033-8}, pages = {705-710}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDMW.2007.65}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Mining Workshops, International Conference on TI - A Secure Clustering Algorithm for Distributed Data Streams SN - 0-7695-3033-8 SP705 EP710 A1 - Geetha Jagannathan, A1 - Krishnan Pillaipakkamnatt, A1 - D. Umano, PY - 2007 VL - 0 JA - Data Mining Workshops, International Conference on ER -

Geetha Jagannathan

Krishnan Pillaipakkamnatt

D. Umano

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDMW.2007.65

We present a distributed privacy-preserving protocol for the clustering of data streams. The participants of the se- cure protocol learn cluster centers only on completion of the protocol. Our protocol does not reveal intermediate candidate cluster centers. It is also efficient in terms of communication. The protocol is based on a new memory- efficient clustering algorithm for data streams. Our experi- ments show that, on average, the accuracy of this algorithm is better than that of the well known k-means algorithm, and compares well with BIRCH, but has far smaller mem- ory requirements.

Citation:

Geetha Jagannathan, Krishnan Pillaipakkamnatt, D. Umano, "A Secure Clustering Algorithm for Distributed Data Streams," icdmw, pp.705-710, Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007), 2007

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.