On classification of graph streams

Proceedings of the 11th SIAM International Conference on Data Mining, SDM 2011

Volumn , Issue , 2011, Pages 652-663

  Aggarwal, Charu C ^a  

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

Author keywords

Classification; Graphs

Indexed keywords

CLASSIFICATION (OF INFORMATION); GRAPHIC METHODS;

CLASSIFICATION OF GRAPHS; DATABASE AND DATA MINING; GRAPHS; PROBABILISTIC APPROACHES; PROBABILISTIC BOUNDS; STRUCTURAL DATA; STRUCTURAL INFORMATION; UNDERLYING GRAPHS;

DATA MINING;

EID: 84874028089     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972818.56     Document Type: Conference Paper

References (21)

1. C. Aggarwal, N. Ta, J. Feng, J. Wang, and M. J. Zaki, XProj: A Framework for Projected Structural Clustering of XML Documents, KDD Conference, (2007).
2. C. Aggarwal, Y. Li, P. Yu, and R. Jin, On Dense Pattern Mining in Graph Streams, VLDB Conference, (2010).
3. C. Aggarwal, Y. Zhao, and P. Yu, On Clustering Graph Streams, SDM Conference, (2010).
4. C. Aggarwal, and H. Wang, Managing and Mining Graph Data, Springer, (2010).
5. C. Aggarwal, Social Network Data Analytics, Springer, (2011).
6. C. Aggarwal, Data Streams: Models and Algorithms, Springer, (2007).
7. D. Chakrabarti, and C. Faloutsos, Graph Mining: Laws, Generators and Algorithms, ACM Computing Surveys, 38(1), (2006).
8. 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), pp. 64-78.
9. M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the internet topology, ACM SIGCOMM Conference, (1999).
10. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang, Graph Distances in the Data Stream Model, SIAM Jour. on Comp., 38(5), (2005), pp. 1709-1727.
11. D. Gibson, R. Kumar, and A. Tomkins, Discovering Large Dense Subgraphs in Massive Graphs, VLDB Conference, (2005).
12. H. He, and A. K. Singh, Efficient Algorithms for Mining Significant Substructures in Large Graphs with Quality Guarantees, ICDM Conference, (2007).
13. H. Kashima, K. Tsuda, and A. Inokuchi, Marginalized Kernels between Labeled Graphs, ICML Conference, (2003).
14. T. Kudo, E. Maeda, and Y. Matsumoto, An Application of Boosting to Graph Classification, NIPS Conf. (2004).
15. S. Raghavan, and H. Garcia-Molina, Representing web graphs, ICDE Conference, (2003).
16. S. Ranu, and A. K. Singh, GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases, ICDE Conference, (2009).
17. M. Rattigan, M. Maier, and D. Jensen, Graph Clustering with Network Sructure Indices. ICML, (2007).
18. H. Wang, W. Fan, P. S. Yu, and J. Han, Mining Concept-Drifting Data Streams using Ensemble Classifiers, ACM KDD Conference, (2003).
19. H. Wang, J. Yin, J. Pei, P. S. Yu, and J. X. Yu, Suppressing Model Overfitting in Mining Concept-Drifting Data Streams, ACM KDD Conference, (2006).
20. X. Yan, and J. Han, CloseGraph: Mining Closed Frequent Graph Patterns, ACM KDD Conference, (2003).
21. M. J. Zaki, and C. C. Aggarwal, XRules: An Effective Structural Classifier for XML Data, KDD Conf. (2003).