
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ran Wolff, Kanishka Bhaduri, Hillol Kargupta, "A Generic Local Algorithm for Mining Data Streams in Large Distributed Systems," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 4, pp. 465478, April, 2009.  
BibTex  x  
@article{ 10.1109/TKDE.2008.169, author = {Ran Wolff and Kanishka Bhaduri and Hillol Kargupta}, title = {A Generic Local Algorithm for Mining Data Streams in Large Distributed Systems}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {21}, number = {4}, issn = {10414347}, year = {2009}, pages = {465478}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.169}, 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  A Generic Local Algorithm for Mining Data Streams in Large Distributed Systems IS  4 SN  10414347 SP465 EP478 EPD  465478 A1  Ran Wolff, A1  Kanishka Bhaduri, A1  Hillol Kargupta, PY  2009 KW  Data mining KW  Mining methods and algorithms KW  Distributed databases KW  Peer to Peer Data Mining KW  Distributed systems KW  Systems and Software KW  Information Storage and Retrieval KW  Information Technology VL  21 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] R. Wolff and A. Schuster, “Association Rule Mining in PeertoPeer Systems,” Proc. Third IEEE Int'l Conf. Data Mining (ICDM '03), pp. 363370, 2003.
[2] D. Krivitski, A. Schuster, and R. Wolff, “A Local Facility Location Algorithm for Sensor Networks,” Proc. First IEEE Int'l Conf. Distributed Computing in Sensor Systems (DCOSS '05), pp. 368375, 2005.
[3] J. Branch, B. Szymanski, R. Wolff, C. Gianella, and H. Kargupta, “InNetwork Outlier Detection in Wireless Sensor Networks,” Proc. 26th IEEE Int'l Conf. Distributed Computing Systems (ICDCS'06), pp. 5158, 2006.
[4] R. Wolff, K. Bhaduri, and H. Kargupta, “Local L2 Thresholding Based Data Mining in PeertoPeer Systems,” Proc. SIAM Conf. Data Mining (SDM '06), pp. 428439, 2006.
[5] P. Luo, H. Xionga, K. Lu, and Z. Shi, “Distributed Classification in PeertoPeer Networks,” Proc. ACM SIGKDD '07, pp. 968976, 2007.
[6] K. Bhaduri and H. Kargupta, “A Scalable Local Algorithm for Distributed Multivariate Regression,” Statistical Analysis and Data Mining J., vol. 1, no. 3, pp. 177194, Nov. 2008.
[7] N. Li, J.C. Hou, and L. Sha, “Design and Analysis of an MSTBased Topology Control Algorithm,” IEEE Trans. Wireless Comm., vol. 4, no. 3, pp. 11951206, 2005.
[8] Y. Birk, L. Liss, A. Schuster, and R. Wolff, “A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion,” Proc. 18th Int'l Symp. Distributed Computing (DISC '04), pp. 275289, 2004.
[9] K. Bhaduri, “Efficient Local Algorithms for Distributed Data Mining in Large Scale Peer to Peer Environments: A Deterministic Approach,” PhD dissertation, Univ. of Maryland, Baltimore County, Baltimore, May 2008.
[10] K. Das, K. Bhaduri, K. Liu, and H. Kargupta, “Distributed Identification of Top$l$ Inner Product Elements and Its Application in a PeertoPeer Network,” IEEE Trans. Knowledge and Data Eng., vol. 20, no. 4, pp. 475488, Apr. 2008.
[11] S. Bandyopadhyay, C. Giannella, U. Maulik, H. Kargupta, K. Liu, and S. Datta, “Clustering Distributed Data Streams in PeertoPeer Environments,” Information Science, vol. 176, no. 14, pp. 19521985, 2006.
[12] W. Kowalczyk, M. Jelasity, and A.E. Eiben, “Towards Data Mining in Large and Fully Distributed PeertoPeer Overlay Networks,” Proc. BelgiumNetherlands Conf. Artificial Intelligence (BNAIC '03), pp. 203210, 2003.
[13] S. Datta, C. Giannella, and H. Kargupta, “$k$ Means Clustering overLarge, Dynamic Networks,” Proc. SIAM Conf. Data Mining (SDM '06), pp. 153164, 2006.
[14] M. Rabbat and R. Nowak, “Distributed Optimization in Sensor Networks,” Proc. Third Int'l Symp. Information Processing in Sensor Networks (IPSN '04), pp. 2027, 2004.
[15] N. Jain, D. Kit, P. Mahajan, P. Yalagandula, M. Dahlin, and Y. Zhang, “STAR: SelfTuning Aggregation for Scalable Monitoring,” Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB '07), pp. 962973, Sept. 2007.
[16] R. van Renesse, K.P. Birman, and W. Vogels, “Astrolabe: A Robust and Scalable Technology for Distributed System Monitoring, Management, and Data Mining,” ACM Trans. Computer Systems, vol. 21, no. 2, pp. 164206, 2003.
[17] D. Kempe, A. Dobra, and J. Gehrke, “Computing Aggregate Information Using Gossip,” Proc. 44th Ann. IEEE Symp. Foundations of Computer Science (FOCS '03), pp. 482491, 2003.
[18] S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, “Gossip Algorithms: Design, Analysis and Applications,” Proc. IEEE INFOCOM '05, pp. 16531664, 2005.
[19] M. Jelasity, A. Montresor, and O. Babaoglu, “GossipBased Aggregation in Large Dynamic Networks,” ACM Trans. Computer Systems, vol. 23, no. 3, pp. 219252, 2005.
[20] Y. Afek, S. Kutten, and M. Yung, “Local Detection for Global SelfStabilization,” Theoretical Computer Science, vol. 186, nos. 12, pp.199230, 1997.
[21] N. Linial, “Locality in Distributed Graph Algorithms,” SIAM J. Computing, vol. 21, no. 1, pp. 1932010, 1992.
[22] M. Naor and L. Stockmeyer, “What Can Be Computed Locally?” Proc. 25th Ann. ACM Symp. Theory of Computing (STOC '93), pp.184193, 1993.
[23] S. Kutten and D. Peleg, “FaultLocal Distributed Mending,” Proc. 14th Ann. ACM Symp. Principles of Distributed Computing (PODC'95), pp. 2027, 1995.
[24] K. Bhaduri, R. Wolff, C. Giannella, and H. Kargupta, “Distributed Decision Tree Induction in PeertoPeer Systems,” Statistical Analysis and Data Mining J., vol. 1, no. 2, pp. 85103, 2008.
[25] M. Bawa, A. Gionis, H. GarciaMolina, and R. Motwani, “The Price of Validity in Dynamic Networks,” Proc. ACM SIGMOD '04, pp. 515526, 2004.