Graph Nodes Clustering Based on the Commute-Time Kernel.
Luh YenFrançois FoussChristine DecaesteckerPascal FrancqMarco SaerensPublished in: PAKDD (2007)
Keyphrases
- random walk
- directed graph
- graph structure
- weighted graph
- undirected graph
- graph structures
- nodes of a graph
- average degree
- edge weights
- graph kernels
- adjacency matrix
- dominating set
- fully connected
- kernel methods
- finding the shortest path
- connected graphs
- spanning tree
- graph representation
- root node
- shortest path
- structured data
- support vector
- kernel function
- planar graphs
- graph laplacian
- graph model
- reproducing kernel hilbert space
- small world
- random graphs
- graph matching
- feature space
- social networks
- citation graph
- graph embedding
- overlapping communities
- graph mining
- graph partitioning
- gaussian processes
- knn
- graphical models
- neighboring nodes
- attributed graphs
- strongly connected
- graph theory
- maximum flow
- minimum cost
- social network analysis
- connected components
- normalized cut