Mining heavy subgraphs in time-evolving networks

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2011, Pages 81-90

  Bogdanov, Petko ^a   Mongiovì, Misael ^a   Singh, Ambuj K ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION LEVEL; DYNAMIC BEHAVIORS; DYNAMIC NETWORK; EDGE WEIGHTS; EXPERIMENTAL EVALUATION; LARGE GRAPHS; LOGARITHMIC TIME; NETWORK SIZE; NP-HARD; ORDERS OF MAGNITUDE; SOCIAL MEDIA; SUB-INTERVAL; SUBGRAPHS; TIME LENGTH; TIME-PERIODS; TRANSPORTATION NETWORK; UPPER BOUND;

DATA MINING; TRAFFIC CONGESTION;

COMMUNICATION;

EID: 84863395320     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2011.101     Document Type: Conference Paper

References (22)

1. J. Leskovec, L. Backstrom, R. Kumar, and A. Tomkins, "Microscopic evolution of social networks," in Proc. of KDD, 2008.
2. M. Kim and J. Han, "A Particle-and-Density Based Evolutionary Clustering Method for Dynamic Networks," in Proc. of VLDB, 2009.
3. Y. Lin, Y. Chi, S. Zhu, H. Sundaram, and H. Sundaram, "Facetnet : A framework for analyzing communities and their evolutions in dynamic networks," in Proc. of WWW, 2008.
4. M. T. Dittrich, G. W. Klau, A. Rosenwald, T. Dandekar, and T. Mller, "Identifying functional modules in proteinprotein interaction networks: an integrated exact approach," J. of Bioinformatics, 2008.
5. H. F. Lee and D. R. Dooly, "Algorithms for the constrained maximum-weight connected graph problem," in Proc. of Naval Research Logistics, 1996.
6. I. Ljubić, R. Weiskircher, U. Pferschy, G. W. Klau, P. Mutzel, and M. Fischetti, "An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem," J. of Math. Prog., 2005.
7. P. Bickel, C. Chen, J. Kwon, and J. Rice, "Traffic Flow on a Freeway Network," J. of Electrical Eng., 2001.
8. R. Jin, S. Mccallen, C. chi Liu, E. Almaas, and X. J. Zhou, "Identifying dynamic network modules with temporal and spatial constraints," in Pac. Symp. Biocomput., 2009.
9. G. Krouk, P. Mirowski, Y. Lecun, D. E. Shasha, and G. M. Coruzzi, "Predictive network modeling of the high-resolution dynamic plant transcriptome in response to nitrate." J. of Genome Biology, 2010.
10. D. S. Johnson, M. Minkoff, and S. Phillips, "The Prize Collecting Steiner Tree Problem : Theory and Practice," Proc. of SODA, 2000.
11. J. Feigenbaum, N. Haven, C. H. Papadimitriou, U. C. Berkeley, and S. Shenker, "Sharing the Cost of Multicast Transmissions," J. Computer and System Sciences, 2001.
12. H. Kwak, C. Lee, H. Park, and S. Moon, "What is twitter, a social network or a news media?" in Proc. of WWW, 2010.
13. J. Yang and J. Leskovec, "Temporal Variation in Online Media." 2011.
14. J. Diesner, T. L. Frantz, and K. M. Carley, "Communication Networks from the Enron Email Corpus It's Always About the People. Enron is no Different," J. of Computational and Mathematical Organization Theory, 2006.
15. K. Borgwardt, H. Kriegel, and P. Wackersreuther, "Pattern Mining in Frequent Dynamic Subgraphs," Proc. of ICDM, 2006.
16. B. Wackersreuther, P. Wackersreuther, A. Oswald, C. Böhm, and K. M. Borgwardt, "Frequent Subgraph Discovery in Dynamic Networks," Proc. of MLG, 2010.
17. T. Oshino, Y. Asano, and M. Yoshikawa, "Time Graph Pattern Mining for Web Analysis and Information Retrieval," WAIM LNCS, 2010.
18. M. Berlingerio and F. Bonchi, "Mining graph evolution rules," in Proc. of ECML PKDD, 2009.
19. J. Abello, T. Eliassi-Rad, and N. Devanur, "Detecting Novel Discrepancies in Communication Networks," Proc. of ICDM, 2010.
20. L. Akoglu and C. Faloutsos, "Event detection in time series of mobile communication graphs," in Proc. of Army Science Conference, 2010.
21. A. Clementi, A. Monti, F. Pasquale, and R. Silvestri, "Information Spreading in Stationary Markovian Evolving Graphs," Informatica, 2009.
22. C. Avin, M. Kouck, and Z. Lotker, "How to explore a fastchanging world," in Automata, Languages and Programming, 2008.