Ting Guo
Lianhua Chi
ABSTRACT
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.
- C. C. Aggarwal. On classification of graph streams. In Proc. of SDM, pages 652--663, 2011.Google Scholar
Cross Ref
- C. C. Aggarwal and H. Wang. Managing and Mining Graph Data, volume 40. Springer, 2010. Google ScholarDigital Library
- L. Chi, B. Li, and X. Zhu. Fast graph stream classification using discriminative clique hashing. In Proc. of PAKDD, pages 225--236, 2013.Google ScholarCross Ref
- G. H. Dietmar. On the randomized complexity of monotone graph properties. Acta Cybernetica, 10(3):119--127, 1992. Google ScholarDigital Library
- S. Kullback. Information theory and statistics. Courier Dover Publications, 1968.Google Scholar
- D. Serre. Matrices: Theory and Applications. Springer, New York, 2002.Google Scholar
- 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.Google Scholar
- L. Tang, H. Liu, J. Zhang, and Z. Nazeri. Community evolution in dynamic multi-mode networks. In Proc. of SIGKDD, pages 677--685, 2008. Google ScholarDigital Library
Index Terms
- Graph hashing and factorization for fast graph stream classification
Recommendations
Collapsible subgraphs of a 4-edge-connected graph
AbstractJaeger in 1979 showed that every 4-edge-connected graph is supereulerian, graphs that have spanning eulerian subgraphs. Catlin in 1988 sharpened Jaeger’s result by showing that every 4-edge-connected graph is collapsible, graphs that ...
Traversability and connectivity of the middle graph of a graph
We define a graph M(G) as an intersection graph @W(F) on the point set V(G) of any graph G. Let X(G) be the line set of G and F = V'(G) @__ __ X(G), where V'(G) indicates the family of all one point subsets of the set V(G). Let M(G) = @W(F). M(G) is ...
Trivially noncontractible edges in a contraction critically 5-connected graph
An edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. A k-connected graph with no k-contractible edge is said to be contraction critically k-connected. An edge of a k-connected graph ...
Comments