Distributed Mining of Spatio-Temporal Event Patterns in Sensor Networks
暂无分享,去创建一个
[1] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[2] Mohammed J. Zaki,et al. CHARM: An Efficient Algorithm for Closed Itemset Mining , 2002, SDM.
[3] Jan Beutel,et al. Next-generation prototyping of sensor networks , 2004, SenSys '04.
[4] Hillol Kargupta,et al. Distributed Data Mining: Algorithms, Systems, and Applications , 2003 .
[5] John F. Roddick,et al. Higher Order Mining: Modelling And Mining TheResults Of Knowledge Discovery , 2000 .
[6] Ulrich Güntzer,et al. Algorithms for association rule mining — a general survey and comparison , 2000, SKDD.
[7] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[8] John F. Roddick,et al. A Survey of Temporal Knowledge Discovery Paradigms and Methods , 2002, IEEE Trans. Knowl. Data Eng..
[9] 沈錳坤. An Efficient Algorithm for Mining Frequent Itemsets over the Entire History of Data Streams , 2004 .
[10] David E. Culler,et al. Lessons from a Sensor Network Expedition , 2004, EWSN.
[11] Wei Hong,et al. A macroscope in the redwoods , 2005, SenSys '05.
[12] Roberto J. Bayardo,et al. Efficiently mining long patterns from databases , 1998, SIGMOD '98.
[13] Matt Welsh,et al. Programming Sensor Networks Using Abstract Regions , 2004, NSDI.
[14] Philip S. Yu,et al. Mining Frequent Patterns in Data Streams at Multiple Time Granularities , 2002 .
[15] Deborah Estrin,et al. Sympathy for the sensor network debugger , 2005, SenSys '05.
[16] Luca Mottola,et al. Programming wireless sensor networks with logical neighborhoods , 2006, InterSense '06.
[17] Suh-Yin Lee,et al. An Efficient Algorithm for Mining Frequent Itemests over the Entire History of Data Streams , 2004 .
[18] Wei Hong,et al. Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .
[19] Mohammed J. Zaki,et al. Efficiently mining maximal frequent itemsets , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[20] Jian Pei,et al. CLOSET+: searching for the best strategies for mining frequent closed itemsets , 2003, KDD '03.
[21] Osmar R. Zaïane,et al. Incremental mining of frequent patterns without candidate generation or support constraint , 2003, Seventh International Database Engineering and Applications Symposium, 2003. Proceedings..
[22] Sunita Sarawagi,et al. Mining Surprising Patterns Using Temporal Description Length , 1998, VLDB.
[23] Rakesh Agarwal,et al. Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.
[24] Gustavo Alonso,et al. Declarative Support for Sensor Data Cleaning , 2006, Pervasive.
[25] Ruoming Jin,et al. An algorithm for in-core frequent itemset mining on streaming data , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).
[26] Hans-Peter Kriegel,et al. Algorithms and Applications for Spatial Data Mining , 2001 .
[27] Jiawei Han,et al. Discovery of Spatial Association Rules in Geographic Information Databases , 1995, SSD.
[28] Philip S. Yu,et al. Moment: maintaining closed frequent itemsets over a stream sliding window , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).
[29] Matt Welsh,et al. MoteLab: a wireless sensor network testbed , 2005, IPSN '05.
[30] Deborah Estrin,et al. A system for simulation, emulation, and deployment of heterogeneous sensor networks , 2004, SenSys '04.
[31] Matt Welsh,et al. Monitoring volcanic eruptions with a wireless sensor network , 2005, Proceeedings of the Second European Workshop on Wireless Sensor Networks, 2005..
[32] Xiaodong Chen,et al. Discovering Temporal Association Rules in Temporal Databases , 1998, IADT.
[33] Mohamed Medhat Gaber,et al. Knowledge Discovery from Sensor Data , 2008 .