On sensor selection in linked information networks

2011 International Conference on Distributed Computing in Sensor Systems and Workshops, DCOSS'11

Volumn , Issue , 2011, Pages

  Aggarwal, Charu C ^a   Bar Noy, Amotz ^b   Shamoun, Simon ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION BOUNDS; EXTERNAL INPUT; EXTERNAL LINKAGES; GREEDY APPROXIMATION ALGORITHMS; GREEDY SELECTION ALGORITHM; INFORMATION NETWORKS; INTEGER PROGRAMMING FORMULATIONS; LARGE-SCALE SENSORS; NATURAL LOGARITHMS; SAMPLING STRATEGIES; SENSOR SELECTION; THEORETICAL MODELS;

ALGEBRA; APPROXIMATION ALGORITHMS; DATA PROCESSING; INFORMATION SERVICES; INTEGER PROGRAMMING; SENSOR NETWORKS;

SENSORS;

EID: 80052441319     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCOSS.2011.5982173     Document Type: Conference Paper

References (18)

1. B. Yi, N. Sidiropoulos, T. Johnson, H. Jagadish, C. Faloutsos, A. Biliris, "Online data mining for co-evolving time sequences," ICDE, 2000.
2. Y. Sakurai, S. Papadimitriou, and C. Faloutsos, "Braid: Stream mining through group lag correlations," in SIGMOD, 2005.
3. J. Sun, S. Papadimitriou, and C. Faloutsos, "Online latent variable detection in sensor networks," in ICDE, 2005.
4. J. Leskovec, "Tutorial summary: Large social and information networks: opportunities for ml," in ICML, 2009.
5. C. Aggarwal, Data Streams: Models and Algorithms. Springer, 2007.
6. R. Cohen and L. Katzir, "The generalized maximum coverage problem," Inf. Process. Lett., vol. 108, no. 1, pp. 15-22, 2008.
7. C. ReVelle and R. Swain, "Central facilities location," Geographical Analysis, vol. 2, pp. 30-42, 1970.
8. S. Khuller, A. Moss, and J. Naor, "The budgeted maximum coverage problem," Inf. Process. Lett., vol. 70, no. 1, pp. 39-45, 1999.
9. A. Krause, A. P. Singh, C. Guestrin, "Near-optimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies," Jour. of Machine Learning Res., vol. 9, pp. 235-284, 2008.
10. S. Madden. (2004, Jun.) Intel Lab Data. [Online] Available: http://db.csail.mit.edu/labdata/labdata.html
11. A. Ostfeld(et.al.), "The battle of the water sensor networks (bwsn): A design challenge for engineers and algorithms," Jour. of Water Resources Planning and Mgmt, vol. 134, no. 6, pp. 556-568, 2008.
12. A. Krause, C. Guestrin, A. Gupta, and J. M. Kleinberg, "Near-optimal sensor placements: maximizing information while minimizing communication cost," in IPSN, 2006.
13. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. M. VanBriesen, and N. S. Glance, "Cost-effective outbreak detection in networks," in KDD, 2007.
14. A. Krause and C. Guestrin, "Near-optimal observation selection using submodular functions," in AAAI, 2007.
15. D. Golovin, M. Faulkner, and A. Krause, "Online distributed sensor selection," in IPSN, 2010.
16. A. Deligiannakis and Y. Kotidis, "Data reduction techniques in sensor networks," IEEE Data Eng. Bull., vol. 28, no. 1, pp. 19-25, 2005.
17. A. Deligiannakis, Y. Kotidis, and N. Roussopoulos, "Compressing historical information in sensor networks," in SIGMOD, 2004.
18. G. Cormode and M. N. Garofalakis, "Sketching streams through the net: Distributed approximate query tracking," in VLDB, 2005.