On dense pattern mining in graph streams

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 975-984

  Aggarwal, Charu C ^a   Li, Yao ^b   Yu, Philip S ^b   Jin, Ruoming ^c  

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

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^c KENT STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DENSE PATTERNS; DENSE STRUCTURES; PROBABILISTIC ALGORITHM; PROBABILISTIC APPROACHES; STREAM PATTERNS; STRUCTURAL PATTERN; SYNTHETIC DATASETS; UNDERLYING GRAPHS;

DATA MINING;

EID: 80052677277     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920964     Document Type: Article

References (13)

1. J. Abello, M. G. Resende, and S. Sudarsky. Massive quasi-clique detection. LATIN Conference, 2002.
2. C. Aggarwal, and H. Wang. Managing and Mining Graph Data. Springer, 2010.
3. Y. Chi, H. Wang, P.S. Yu, and R. R. Muntz. Moment: Maintaining closed frequent itemsets over a stream sliding window. ICDM Conference, 2004.
4. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. Ullman, and C. Yang. Finding Interesting Associations without Support Pruning, IEEE TKDE, 13(1), 2001.
5. D. Gibson, R. Kumar, and A. Tomkins. Discovering Large Dense Subgraphs in Massive Graphs, VLDB Conference, 2005.
6. H. He, and A. K. Singh. Efficient Algorithms for mining significant substructures from graphs with quality guarantees. ICDM Conference, 2007.
7. R. Jin, and G. Agrawal. An algorithm for in-core frequent itemset mining on streaming data. ICDM Conference, 2005.
8. S. Navlakha, R. Rastogi, and N. Shrivastava. Graph summarization with bounded error. SIGMOD, 2008.
9. J. Pei, D. Jiang, and A. Zhang. On mining cross-graph quasi-cliques. KDD, 2005.
10. S. Ranu, and A. K. Singh. GraphSig: A scalable approach to min- ing significant subgraphs in large graph databases. ICDE Conference, 2009.
11. X. Yan, and J. Han. CloseGraph: Mining Closed Frequent Graph Patterns. KDD, 2003.
12. J. Xu Yu, Z. Chong, H. Lu, and A. Zhou. False positive or false negative: Mining frequent itemsets from high speed transactional data streams. VLDB Conference, 2004.
13. Z. Zeng, J. Wang, L. Zhou, and G. Karypis. Out-of-core Coherent Closed Quasi-Clique Mining from Large Dense Graph Databases. ACM TODS, Vol 31(2), 2007.