Event detection in activity networks

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2014, Pages 1176-1185

  Rozenshtein, Polina ^a   Anagnostopoulos, Aris ^b   Gionis, Aristides ^a   Tatti, Nikolaj ^a  

^a AALTO UNIVERSITY   (Finland)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

event detection; maximum cut; prize collecting steiner tree; submodular function maximization

Indexed keywords

EID: 84907029447     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2623330.2623674     Document Type: Conference Paper

References (31)

1. D. Agarwal, A. McGregor, J. M. Phillips, S. Venkatasubramanian, and Z. Zhu. Spatial scan statistics: Approximations and performance study. KDD, 2006.
2. D. Agarwal, J. M. Phillips, and S. Venkatasubramanian. The hunting of the bump: On maximizing statistical discrepancy. SODA, 2006.
3. L. Akoglu and C. Faloutsos. What is strange in large networks? graph-based irregularity and fraud detection, 2012. Tutorial presented at ICDM.
4. A. Archer, M. H. Bateni, M. T. Hajiaghayi, and H. Karloff. Improved approximation algorithms for prize-collecting Steiner tree and TSP. SIAM Journal on Computing, 40(2), 2011.
5. S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. JCSS, 58(1), 1999.
6. Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama. Greedily finding a dense subgraph. SWAT, pages 136-148, 1996.
7. R. Assunção, M. Costa, A. Tavares, and S. Ferreira. Fast detection of arbitrarily shaped disease clusters. Statistics in medicine, 25, 2006.
8. T. Baldwin, P. Cook, B. Han, A. Harwood, S. Karunasekera, and M. Moshtaghi. A support platform for event detection using social intelligence. EACL, 2012.
9. M. H. Bhuyan, D. K. Bhattacharyya, and J. K. Kalita. An effective unsupervised network anomaly detection method. ICACCI, 2012.
10. D. Bienstock, M. X. Goemans, D. Simchi-Levi, and D. Williamson. A note on the prize-collecting traveling salesman problem. Mathematical programming, 59(1-3), 1993.
11. B. Boden, S. Gunnemann, H. Hoffmann, and T. Seidl. Mining coherent subgraphs in multi-layer graphs with edge labels. KDD, 2012.
12. M. M. Breunig, H.-P. Kriegel, R. T. Ng, and J. Sander. LOF: identifying density-based local outliers. SIGMOD, 2000.
13. N. Buchbinder, M. Feldman, J. S. Naor, and R. Schwartz. A tight linear time (1/2)-approximation for unconstrained submodular maximization. FOCS, 2012.
14. M. Charikar. Greedy approximation algorithms for finding dense components in a graph. APPROX, 2000.
15. Z. Cheng, J. Caverlee, K. Lee, and D. Z. Sui. Exploring millions of footprints in location sharing services. ICWSM, 2011.
16. U. Feige, G. Kortsarz, and D. Peleg. The dense k -subgraph problem. Algorithmica, 29(3), 2001.
17. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24(2), 1995.
18. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. JACM, 42(6), 1995.
19. V. Guralnik and J. Srivastava. Event detection from time series data. KDD, 1999.
20. N. A. Heard, D. J. Weston, K. Platanioti, and D. J. Hand. Bayesian anomaly detection methods for social networks. Ann. Appl. Stat., 4(2), 2010.
21. D. S. Johnson, M. Minkoff, and S. Phillips. The prize-collecting Steiner tree problem: theory and practice. SODA, 2000.
22. S. Khuller and B. Saha. On finding dense subgraphs. ICALP, 2009.
23. M. Kulldorff. A spatial scan statistic. Communications in Statistics-Theory and Methods, 26(6), 1997.
24. M. Olson, A. Liu, M. Faulkner, and K. M. Chandy. Rapid detection of rare geospatial events: earthquake warning applications. DEBS, 2011.
25. G. P. Patil and C. Taillie. Upper level set scan statistic for detecting arbitrarily shaped hotspots. Environmental and Ecological Statistics, 11, 2004.
26. S. Seufert, S. J. Bedathur, J. Mestre, and G. Weikum. Bonsai: Growing interesting small trees. In ICDM, pages 1013-1018, 2010.
27. T. Tango and K. Takahashi. A flexibly shaped spatial scan statistic for detecting clusters. International Journal of Health Geographics, 4-11, 2005.
28. K.-C. Toh, M. J. Todd, and R. H. Tütüncü. SDPT3 - a Matlab software package for semidefinite programming, version 1.3. Optimization methods and software, 11(1-4), 1999.
29. C. Tsourakakis, F. Bonchi, A. Gionis, F. Gullo, and M. Tsiarli. Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. KDD, 2013.
30. M. Walther and M. Kaisser. Geo-spatial event detection in the twitter stream. ECIR, 2013.
31. K. Watanabe, M. Ochi, M. Okabe, and R. Onai. Jasmine: a real-time local-event detection system based on geolocation information propagated to microblogs. CIKM, 2011.