Spotting significant changing subgraphs in evolving graphs

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2008, Pages 917-922

  Liu, Zheng ^a   Yu, Jeffrey Xu ^a   Ke, Yiping ^a   Lin, Xuemin ^b   Chen, Lei ^c  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION DOMAINS; EFFICIENT ALGORITHM; EVOLVING GRAPHS; HIGH QUALITY; REAL DATA SETS; STRUCTURAL RELATIONSHIP; SUBGRAPHS;

INFORMATION MANAGEMENT; MINING;

SENSOR NETWORKS;

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

References (10)

1. http://www.informatik.uni-trier.de/~ley/db/.
2. http://www.cs.cmu.edu/~enron/.
3. H. Bunke, P. J. Dickinson, M. Kraetzl, and W. D. Wallis. A Graph-Theoretic Approach to Enterprise Network Dynamics. Birkhauser, 2006.
4. C. Faloutsos, K. S. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In KDD. ACM, 2004.
5. G. Jeh and J. Widom. Simrank: a measure of structuralcontext similarity. In KDD. ACM, 2002.
6. G. Jeh and J. Widom. Scaling personalized web search. In WWW. ACM, 2003.
7. J.-Y. Pan, H.-J. Yang, C. Faloutsos, and P. Duygulu. Automatic multimedia cross-modal correlation discovery. In KDD. ACM, 2004.
8. B. E. Shakhnovich and J. M. Harvey. Quantifying structurefunction uncertainty: A graph theoretical exploration into the origins and limitations of protein annotation. Journal of Molecular Biology, 4(337), 2004.
9. H. Tong, C. Faloutsos, and Y. Koren. Fast direction-aware proximity for graph mining. In KDD. ACM, 2007.
10. H. Tong, S. Papadimitriou, P. S. Yu, and C. Faloutsos. Proximity tracking on time-evolving bipartite graphs. In SDM, 2008.