Graph hashing and factorization for fast graph stream classification

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2013, Pages 1607-1612

  Guo, Ting ^a   Chi, Lianhua ^a   Zhu, Xingquan ^a  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

Graph stream; Matrix factorization; Mining algorithm

Indexed keywords

FACTORIZATION APPROACH; FEATURE REPRESENTATION; GRAPH CLASSIFICATION; GRAPH STREAM; LINEAR COMBINATIONS; MATRIX FACTORIZATIONS; MINING ALGORITHMS; STREAM CLASSIFICATION;

ALGORITHMS; KNOWLEDGE MANAGEMENT; TRANSFER MATRIX METHOD;

FACTORIZATION;

EID: 84889594515     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2505515.2505730     Document Type: Conference Paper

References (8)

1. C. C. Aggarwal. On classification of graph streams. In Proc. of SDM, pages 652-663, 2011.
2. C. C. Aggarwal and H. Wang. Managing and Mining Graph Data, Volume 40. Springer, 2010.
3. L. Chi, B. Li, and X. Zhu. Fast graph stream classification using discriminative clique hashing. In Proc. of PAKDD, pages 225-236, 2013.
4. G. H. Dietmar. On the randomized complexity of monotone graph properties. Acta Cybernetica, 10(3):119-127, 1992.
5. S. Kullback. Information theory and statistics. Courier Dover Publications, 1968.
6. D. Serre. Matrices: Theory and Applications. Springer, New York, 2002.
7. R. R. Sokal and F. J. Rohlf. Biometry: the principles and practice of statistics in biological research. W.H. Freeman & Co Ltd, New York, 1981.
8. L. Tang, H. Liu, J. Zhang, and Z. Nazeri. Community evolution in dynamic multi-mode networks. In Proc. of SIGKDD, pages 677-685, 2008.