Sensor networks: decentralized monitoring and subspace classification of events

References

• Agarwal , N. , Haque , E. , Liu , H. and Parsons , L. 2006 . A subspace clustering framework for research group collaboration . International journal of information technology and web engineering , : 35 – 58 . Washington, DC, USA, May
   Google Scholar
• Aggarwal, C. and Yu, P., 2000. Finding generalized projected clusters in high dimensional space In: Proceedings of ACM SIGMOD international conference on management of data (SIGMOD), Dallas, Texas, USA, May
   Google Scholar
• Aggarwal, C.C. and Procopiuc, C., 1999. Fast algorithms for projected clustering. In: Proceedings of ACM SIGMOD international conference on management of data (SIGMOD), Philadelphia, Pennsylvania, USA, June
   Google Scholar
• Agrawal, R., Gehrke, J., Gunopulos, D. and Raghavan, P., 1998. Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of ACM SIGMOD international conference on management of data (SIGMOD), Seattle, Washington, USA, June
   Google Scholar
• Ankerst , M. , Breunig , M.M. , Kriegel , H.-P. and Sander , J. 1999 . “ OPTICS: ordering points to identify the clustering structure ” . In In: Proceedings of ACM SIGMOD international conference on management of data (SIGMOD) , Pennsylvania, USA, June : Philadelphia .
   Google Scholar
• Briemann , L. 1996 . Bagging predicator . Machine learning , 26 : 123 – 140 .
   Google Scholar
• Celeux , G. and Govaert , G. 1992 . A classification EM algorithm for clustering and two stochastic versions . Computational statistics and data analysis , 14 : 315 – 332 .
   Web of Science ®Google Scholar
• Chan , P. and Stolfo , S. 1993 . “ Experiments in multistrategy learning by meta-learning ” . In Proceedings of the second international conference on information and knowledge management Washington, DC, USA
   Google Scholar
• Chawla , N.V. , Lazarevic , A. , Hall , L.O. and Bowyer , K. 2003 . “ SMOTEBoost: improving prediction of the minority class in boosting ” . In In: Proceedings of principles of knowledge discovery in databases , Germany : Freiburg .
   Google Scholar
• Dash , M. , Liu , H. and Xu , X. 2001a . “ ‘1+1>2’: merging distance and density based clustering ” . In The 7th international conference on database systems for advanced applications (DASFAA) 32 – 39 . Hong Kong, China
   Google Scholar
• Dash , M. , Tan , K.L. and Liu , H. 2001b . “ Efficient yet accurate clustering ” . In IEEE international conference on data mining (ICDM) 99 – 106 . San Jose, CA, USA
   Google Scholar
• Ester , M. , Kriegel , H.-P. , Sander , J. and Xu , X. 1996 . “ A density-based algorithm for discovering clusters in large spatial databases with noise ” . In In: Proceedings of 2nd international conference on knowledge discovery and data mining (KDD) 291 – 316 . Portland, OR, USA
   Google Scholar
• Hartigan , J.A. and Wong , M.A. 1979 . A K-means clustering algorithm . Applied statistics , 28 : 100 – 108 .
   Google Scholar
• Hinneburg , A. and Keim , D.A. 1998 . “ An efficient approach to clustering in large multimedia databases with noise ” . In Proceedings of 4th international conference on knowledge discovery and data mining (KDD) 224 – 228 . New York, USA
   Google Scholar
• Japkowicz , N. 2002 . “ Supervised learning with unsupervised output separation ” . In International conference on artificial intelligence and soft computing 321 – 325 . Banff, Alberta, Canada
   Google Scholar
• Jin , R. and Liu , H. 2005 . “ A novel approach to model generation for heterogeneous data classification ” . In The 19th international joint conference on AI (IJCAI) Edinburgh, Scotland heterogeneous data classification
   Google Scholar
• Kailing , K. , Kriegel , H.-P. and Kroger , P. 2004 . “ Density-connected subspace clustering for high-dimensional data ” . In Proceedings of SIAM international conference on data mining (SDM) Lake Buena Vista, FL
   Google Scholar
• Kargupta , H. , Park , B. , Hershberger , D. and Johnson , E. 1999 . “ Collective data mining: a new perspective towards distributed data mining ” . In Advances in distributed data mining , Edited by: Kargupta , H. and Chan , P. AAAI/MIT Press .
   Google Scholar
• McConnell , S. and Skillicorn , D.B. 2004 . “ Building predictors form vertically distributed data ” . In Proceedings of the 14th annual IBM Centers for advanced studies conference Ontario, Canada
   Google Scholar
• McConnell , S. and Skillicorn , D.B. 2005 . “ A distributed approach for prediction in sensor networks ” . In Workshop on data mining in sensor networks, SIAM international conference on data mining , CA, USA : Newport Beach .
   Google Scholar
• Newman, D.J., Hettich, S., Blake, C.L. and Merz, C.J., 1998. UCI repository of machine learning databases. Available from: http://www.ics.uci.edu/∼mlearn/MLRepository.html (http://www.ics.uci.edu/sim$mlearn/mlrepository.html) , University of California, Irvine, Department of Information and Computer Sciences
   Google Scholar
• Parson , L. , Haque , E. and Liu , H. 2004 . Subspace clustering for high dimensional data – a review . SIGKDD explorations , 6 ( 1 ) : 90 – 105 .
   Google Scholar
• Schapire , R.E. and Singer , Y. 1999 . Improved boosting algorithms using confidence-rated predictions . Machine learning , 37 : 291 – 336 .
   Google Scholar
• Singhi , S. and Liu , H. 2005 . “ Error-sensitive grading for model combination ” . In Proceedings of the European conference on machine learning (ECML/PKDD) 733 – 740 . Porto, Portugal
   Google Scholar
• Witten , I.H. and Frank , E. 2005 . Data mining: practical machine learning tools and techniques , 2nd ed. , San Francisco, CA : Morgan Kaufmann .
   Google Scholar
• Yu , L. and Liu , H. 2003 . “ Feature selection for high-dimensional data: a fast correlation-based filter solution ” . In Proceedings of the twentieth international conference on machine leaning (ICML) Washington, DC USA
   Google Scholar