Graph nodes clustering with the sigmoid commute-time kernel: A comparative study.
Luh YenFrançois FoussChristine DecaesteckerPascal FrancqMarco SaerensPublished in: Data Knowl. Eng. (2009)
Keyphrases
- random walk
- graph structure
- directed graph
- normalized cut
- graph theoretic
- adjacency matrix
- graph clustering
- proximity measures
- weighted graph
- clustering algorithm
- graph partitioning
- undirected graph
- graph model
- k means
- similarity function
- clustering method
- graph representation
- random graphs
- nodes of a graph
- graph kernels
- graph structures
- kernel function
- spectral methods
- graph construction
- attributed graphs
- connected graphs
- data clustering
- spectral clustering
- edge weights
- planar graphs
- strongly connected
- fully connected
- graph laplacian
- small world
- dominating set
- directed acyclic graph
- citation graph
- graph theory
- bayesian networks
- feature space
- graph layout
- similarity measure
- support vector
- pairwise
- probability distribution
- data points
- shortest path
- high dimensional data
- kernel methods
- data objects
- belief networks
- graph matching