
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Souptik Datta, Chris R. Giannella, Hillol Kargupta, "Approximate Distributed KMeans Clustering over a PeertoPeer Network," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 10, pp. 13721388, October, 2009.  
BibTex  x  
@article{ 10.1109/TKDE.2008.222, author = {Souptik Datta and Chris R. Giannella and Hillol Kargupta}, title = {Approximate Distributed KMeans Clustering over a PeertoPeer Network}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {21}, number = {10}, issn = {10414347}, year = {2009}, pages = {13721388}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.222}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Approximate Distributed KMeans Clustering over a PeertoPeer Network IS  10 SN  10414347 SP1372 EP1388 EPD  13721388 A1  Souptik Datta, A1  Chris R. Giannella, A1  Hillol Kargupta, PY  2009 KW  Peertopeer data mining KW  distributed Kmeans clustering. VL  21 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] H. Ang, V. Gopalkrishnan, S. Hoi, and W. Ng, “Cascade RSVM in PeertoPeer Networks,” Proc. European Conf. Principles of Data Mining and Knowledge Discovery (PKDD '08), pp. 5570, 2008.
[2] P. Luo, H. Xiong, K. Lu, and Z. Shi, “Distributed Classification in PeertoPeer Networks,” Proc. ACM Workshop Knowledge Discovery from Sensor Data (KDD '07), pp. 968976, 2007.
[3] A. Vlachou, C. Doulkeridis, K. Norvag, and M. Vazirgiannis, “On Efficient TopK Query Processing in Highly Distributed Environments,” Proc. ACM SIGMOD, pp. 753764, 2008.
[4] S. Datta, C. Giannella, and H. Kargupta, “KMeans Clustering over a Large, Dynamic Network,” Proc. SIAM Int'l Conf. Data Mining, pp. 153164, 2006.
[5] K. Liu, K. Bhaduri, K. Das, P. Nguen, and H. Kargupta, “ClientSide Web Mining for Community Formation in PeertoPeer Environments,” SIGKDD Explorations, vol. 8, pp. 1120, 2006.
[6] M. Bawa, A. Gionis, H. GarciaMolina, and R. Motwani, “The Price of Validity in Dynamic Networks,” J. Computer and System Sciences, vol. 73, no. 3, pp. 245264, 2007.
[7] W. Muller, M. Eisenhart, and A. Henrich, “Efficient ContentBased P2P Image Retrieval Using Peer Content Descriptions,” Proc. Internet Imaging V, pp. 5768, 2004.
[8] S. Bandyopadhyay, C. Giannella, U. Maulik, H. Kargupta, K. Liu, and S. Datta, “Clustering Distributed Data Streams in PeertoPeer Environments,” Information Sciences, vol. 176, no. 14, pp. 19521985, 2006.
[9] H. Kargupta, W. Huang, K. Sivakumar, and E. Johnson, “Distributed Clustering Using Collective Principal Component Analysis,” Knowledge and Information Systems, vol. 3, pp. 422448, 2001.
[10] H. Kargupta and K. Sivakumar, “Existential Pleasures of Distributed Data Mining,” Data Mining: Next Generation Challenges and Future Directions, AAAI Press, 2004.
[11] I. Dhillon and D. Modha, “A DataClustering Algorithm on Distributed Memory Multiprocessors,” Proc. KDD Workshop High Performance Knowledge Discovery, pp. 245260, 1999.
[12] G. Forman and B. Zhang, “Distributed Data Clustering Can Be Efficient and Exact,” SIGKDD Explorations, vol. 2, no. 2, pp. 3438, 2000.
[13] D. Kempe, A. Dobra, and J. Gehrke, “Computing Aggregate Information Using Gossip,” Proc. IEEE Symp. Foundations of Computer Science (FoCS '03), pp. 482491, 2003.
[14] S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, “Gossip Algorithms: Design, Analysis, and Applications,” Proc. IEEE INFOCOM, vol. 3, pp. 16531664, 2005.
[15] W. Kowalczyk, M. Jelasity, and A. Eiben, “Towards Data Mining in Large and Fully Distributed PeertoPeer Overlay Networks,” Proc. BelgiumNetherlands Artificial Intelligence Conf. (BNAIC '03), pp.203210, 2003.
[16] R. Wolff and A. Schuster, “Association Rule Mining in PeertoPeer Systems,” IEEE Trans. Systems, Man, and Cybernetics, Part B, vol. 34, no. 6, pp. 24262438, Dec. 2004.
[17] D. Krivitski, A. Schuster, and R. Wolff, “A Local Facility Location Algorithm for LargeScale Distributed Systems,” J. Grid Computing, vol. 5, no. 4, pp. 361378, 2007.
[18] J. Branch, B. Szymanski, C. Giannella, R. Wolff, and H. Kargupta, “InNetwork Outlier Detection in Wireless Sensor Networks,” Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS '06), p.51, 2006.
[19] N. Palatin, A. Leizarowitz, and A. Schuster, “Mining for Misconfigured Machines in Grid Systems,” Proc. ACM Workshop Knowledge Discovery from Sensor Data (KDD '06), pp. 687692, 2006.
[20] K. Bhaduri, R. Wolff, C. Giannella, and H. Kargupta, “Distributed Decision Tree Induction in PeertoPeer Systems,” Statistical Analysis and Data Mining, vol. 1, no. 2, pp. 85103, 2008.
[21] J. Clemente, X. Defago, and K. Satou, “Asynchronous PeertoPeer Communication for Failure Resilient Distributed Genetic Algorithms,” Proc. IASTED Int'l Conf. Parallel and Distributed Computing and Systems (PDCS '03), pp. 769773, 2003.
[22] I. Sharfman, A. Schuster, and D. Keren, “A Geometric Approach to Monitoring Threshold Functions over Distributed Data Streams,” ACM Trans. Database Systems, vol. 32, no. 4, pp. 23:123:29, 2007.
[23] K. Bhaduri and H. Kargupta, “An Efficient Local Algorithm for Distributed Multivariate Regression in PeertoPeer Networks,” Proc. SIAM Int'l Conf. Data Mining, pp. 153164, 2008.
[24] R. Wolff, K. Bhaduri, and H. Kargupta, “Local L2 Thresholding Based Data Mining in PeertoPeer Systems,” Proc. 2006 SIAM Int'l Conf. Data Mining, 2006.
[25] C. Tang, Z. Xu, and S. Dwarkadas, “PeertoPeer Information Retrieval Using SelfOrganizing Semantic Overlay Networks,” Proc. ACM SIGCOMM, pp. 175186, 2004.
[26] P. Cao and Z. Wang, “Efficient TopK Query Calculation in Distributed Networks,” Proc. ACM Symp. Principles of Distributed Computing (PODC '04), pp. 206215, 2004.
[27] S. Michel, P. Triantafillou, and G. Weikum, “KLEE: A Framework for Distributed TopK Query Algorithms,” Proc. Int'l Conf. Very Large Data Bases (VLDB '05), pp. 637648, 2005.
[28] S. Shi, J. Yu, G. Yang, and D. Wang, “Distributed Page Ranking in Structured P2P Networks,” Proc. Int'l Conf. Parallel Processing (ICPP '03), pp. 179186, 2003.
[29] W.T. Balke, W. Nejdl, W. Siberski, and U. Thaden, “Progressive Distributed Topk Retrieval in PeertoPeer Networks,” Proc. Int'l Conf. Data Eng. (ICDE '05), pp. 174185, 2005.
[30] P. Domingos and G. Hulten, “A General Method for Scaling Up Machine Learning Algorithms and Its Application to Clustering,” Proc. Int'l Conf. Machine Learning (ICML '01), pp. 106113, 2001.
[31] W. Cochran, Sampling Techniques. John Wiley & Sons, Inc., 1977.
[32] V. Lo, D. Zhou, Y. Liu, C. GauthierDickey, and J. Li, “Scalable Supernode Selection in PeertoPeer Overlay Networks,” Proc. Int'l Workshop Hot Topics in PeertoPeer Systems (HOTP2P), 2005.
[33] C. Gkantsidis, M. Mihail, and A. Saberi, “Random Walks in PeertoPeer Networks,” Proc. IEEE INFOCOM, 2004.
[34] M. Zhong, K. Shen, and J. Seiferas, “NonUniform Random Membership Management in PeertoPeer Networks,” Proc. IEEE INFOCOM, 2005.
[35] N. Metropolis, A.W. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller, “Equations of State Calculations by Fast Computing Machines,” J. Chemical Physics, vol. 21, no. 2, pp. 10871092, 1953.
[36] A. Awan, R. Ferreira, A. Grama, and S. Jagannathan, “Distributed Uniform Sampling in Unstructured PeertoPeer Networks,” Proc. Int'l Conf. System Sciences, 2006.
[37] S. Datta and H. Kargupta, “Uniform Sampling from a PeertoPeer Network,” Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS '07), p. 50, 2007.
[38] Z. Shen, “Average Diameter of Network Structures and Its Estimation,” Proc. ACM Symp. Applied Computing (SAC '98), pp.593597, 1998.