Graph Hashing and Factorization for Fast Graph Stream Classification

Publisher:
ACM
Publication Type:
Conference Proceeding
Citation:
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management CIKM, 2013, pp. 1607 - 1612
Issue Date:
2013-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013001509OK.pdf1.17 MB
Adobe PDF
Graph stream classification concerns building learning models from continuously growing graph data, in which an essential step is to explore subgraph features to represent graphs for effective learning and classification. When representing a graph using subgraph features, all existing methods employ coarse-grained feature representation, which only considers whether or not a subgraph feature appears in the graph. In this paper, we propose a fine-grained graph factorization approach for Fast Graph Stream Classification (FGSC). Our main idea is to find a set of cliques as feature base to represent each graph as a linear combination of the base cliques. To achieve this goal, we decompose each graph into a number of cliques and select discriminative cliques to generate a transfer matrix called Clique Set Matrix (M). By using M as the base for formulating graph factorization, each graph is represented in a vector space with each element denoting the degree of the corresponding subgraph feature related to the graph, so existing supervised learning algorithms can be applied to derive learning models for graph classification.
Please use this identifier to cite or link to this item: