Matrix Representations of Graphs and Their Experimental Comparison for Detecting Non-subgraphs by Eigenvalues.
Kaoru KatayamaTakumi SatoPublished in: J. Inf. Process. (2014)
Keyphrases
- experimental comparison
- eigenvalues and eigenvectors
- graph mining
- adjacency matrix
- laplacian matrix
- graph databases
- covariance matrix
- subgraph isomorphism
- singular value decomposition
- subgraph matching
- graph properties
- singular values
- connected subgraphs
- labeled graphs
- graph data
- subgraph mining
- correlation matrix
- maximum common subgraph
- graph representations
- feature selection
- frequent subgraph mining
- graph representation
- graph matching
- maximum clique
- directed graph
- reachability queries
- graph structures
- query graph
- frequent subgraphs
- dense subgraphs
- symmetric matrices
- graph clustering
- topological information
- graph theory
- low rank
- pseudo inverse
- spectral clustering
- pattern mining
- graph theoretic
- graph structure
- undirected graph
- eigendecomposition
- graph patterns
- positive definite
- graph kernels
- maximal cliques
- structured data
- dimensionality reduction
- data structure
- data mining