EDISKCO: Energy efficient distributed in-sensor-network K-center clustering with outliers

Proceedings of the 3rd International Workshop on Knowledge Discovery from Sensor Data, SensorKDD'09 in Conjunction with the 15th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD-09

Volumn , Issue , 2009, Pages 39-48

  Hassani, Marwan ^a   Müller, Emmanuel ^a   Seidl, Thomas ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING QUALITY; DATA MINING TECHNIQUES; EFFICIENT COMPUTATION; EFFICIENT DETECTION; ENERGY AWARE; ENERGY EFFICIENT; HIGH QUALITY; IN-NETWORK; INCREMENTAL METHOD; K-CENTER; LIFE-TIMES; OBJECTS-BASED; REAL WORLD DATA; SENSOR CLUSTERING; SENSOR MEASUREMENTS;

CLUSTERING ALGORITHMS; DATA MINING; ENERGY EFFICIENCY; FLUORINE CONTAINING POLYMERS; SENSOR NODES; TELECOMMUNICATION EQUIPMENT;

SENSOR NETWORKS;

EID: 70450099261     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1601966.1601975     Document Type: Conference Paper

References (18)

1. I. Assent, R. Krieger, E. Müller, and T. Seidl. INSCY: Indexing subspace clusters with in-process-removal of redundancy. In Proc. IEEE ICDM, pages 719-724, 2008.
2. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is nearest neighbors meaningful. In Proc. IDBT, pages 217-235, 1999.
3. M. Charikar, C. Chekuri, T. Feder, and R. Motwani. Incremental clustering and dynamic information retrieval. In Proc. ACM STOC:, pages 626-635, 1997.
4. M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan. Algorithms for facility location problems with outliers. In Proc. SODA, pages 642-651, 2001.
5. M. Charikar, L. O'Callaghan, and R. Panigrahy. Better streaming algorithms for clustering problems. In Proc. ACM STOC, pages 30-39, 2003.
6. G. Cormode, S. Muthukrishnan, and W. Zhuang. Conquering the divide: Continuous clustering of distributed data streams. In Proc. IEEE ICDE, pages 1036-1045, 2007.
7. T. Feder and D. Greene. Optimal algorithms for approximate clustering. In Proc. ACM STOC, pages 434-444, 1988.
8. A. R. Ganguly, J. Gama, O. A. Omitaomu, M. M. Gaber, and R. R. Vatsavai. Knowledge Discovery from Sensor Data. 2008.
9. T. F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38(2-3):293-306, 1985.
10. S. Guha. Tight results for clustering and summarizing data streams. In Proc. ICDT, pages 268-275, 2009.
11. W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan. Energy-efficient communication protocol for wireless microsensor networks. In Proc. HICSS, 2000.
12. D. Hochbaum and D. Shmoys. A best possible approximation algorithm for the k-centre problem. Math. of Operations Research, 10:180-184, 1985.
13. R. Matthew Mccutchen and S. Khuller. Streaming algorithms for k-center clustering with outliers and with anonymity. In Proc. Workshop APPROX / RANDOM, pages 165-178, 2008.
14. E. Müller, I. Assent, R. Krieger, S. Günnemann, and T. Seidl. DensEst: Density estimation for data mining in high dimensional spaces. In Proc. SIAM SDM, pages 173-184, 2009.
15. E. Müller, I. Assent, U. Steinhausen, and T. Seidl. OutRank: ranking outliers in high dimensional data. In Proc. DBRank Workshop at IEEE ICDE, pages 600-603, 2008.
16. S. F. Ossama Younis. Heed: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks. IEEE Transactions on Mobile Computing, 3(4):366-379, 10 2004.
17. A. S. Tanenbaum, C. Gamage, and B. Crispo. Taking sensor networks from the lab to the jungle. Computer, 39(8):98-100, 2006.
18. R. Tibshirani and G. Walther. Cluster validation by prediction strength. Journal of Computational & Graphical Statistics, 14(3):511-528, September 2005.