Local L2-thresholding based data mining in peer-to-peer systems

Proceedings of the Sixth SIAM International Conference on Data Mining

Volumn 2006, Issue , 2006, Pages 430-441

  Wolff, Ran ^a   Bhaduri, Kanishka ^a   Kargupta, Hillol ^a  

^a UNIVERSITY OF MARYLAND BALTIMORE COUNTY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER NETWORKS; DECISION MAKING; FEEDBACK; MATHEMATICAL MODELS; MOBILE COMPUTING; ROUTERS;

FEEDBACK LOOP; PEER-TO-PEER SYSTEMS; SEARCH STRATEGIES; WIRELESS SENSORS;

DATA MINING;

EID: 33745461062     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972764.38     Document Type: Conference Paper

References (18)

1. S. Banyopadhyay, C. Giannella, U. Maulik, H. Kargupta, S. Datta, and K. Liu. Clustering distributed data streams in peer-to-peer environments. Information Science, in press.
2. M. Bawa, A. Gionis, H. Garcia-Molina, and R. Motwani. The price of validity in dynamic networks. In Proc. of SIGMOD, 2004.
3. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip algorithms: Design, analysis and applications. In Proc. IEEE Infocom'05, 2005.
4. BRITE: Boston university Representative Internet Topology gEnerator. http://www.cs.bu.edu/brite/.
5. D. Cheung, J. Han, V. Ng, and C. Wong. Maintenance of discovered association rules in large databases: An incremental updating technique. In Proc. of ICDE, 1996.
6. J. Clemente, X. Défago, and K. Satou. Asynchronous peer-to-peer communication for failure resilient distributed genetic algorithms. In Proc. of PDCS, 2003.
7. P. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulie. From epidemics to distributed computing. IEEE computer, 37(5):60-67, May 2004.
8. G. Hulten, L. Spencer, and P. Domingos. Mining time-changing data streams. In Proc. of SIGKDD, 2001.
9. S. Kamvar, M. Schlosser, and H. Garcia-Molina. The eigentrust algorithm for reputation management in p2p networks. In Proc. of WWW, 2003.
10. D. Kempe, A. Dobra, and J. Gehrke. Computing aggregate information using gossip. In Proc. of FoCS, 2003.
11. W. Kowalczyk, M. Jelasity, and A. Eiben. Towards data mining in large and fully distributed peer-to-peer overlay networks. In Proc. of BNAIC, 2003.
12. D. Krivitski, A. Schuster, and R. Wolff. A local facility location algorithm for sensor networks. In Proc. of DCOSS, 2005.
13. S. Kullback. Information theory and statistics. Dover, New York, 1968.
14. S. Kutten and D. Peleg. Fault-local distributed mending. In Proc. of PODC, 1995.
15. N. Linial. Locality in distributed graph algorithms. SIAM Journal of Computing, 21:193-201, 1992.
16. J. MacQueen. Some methods for classification and analysis of multivariate observations. In Proc. of Berkeley Symposium on Mathematical Statistics and Probability, volume 1, pages 281-297, 1967.
17. S. Thomas, S. Bodagala, K. Alsabti, and S. Ranka. An efficient algorithm for the incremental updation of association rules in large databases. In Proc. of SIGKDD, 1997.
18. R. Wolff and A. Schuster. Association rule mining in peer-to-peer systems. In Proc. of ICDM, 2003.