A Stochastic Heuristic for Visualising Graph Clusters in a Bi-Dimensional Space Prior to Partitioning.
Pascale KuntzDominique SnyersPaul J. LayzellPublished in: J. Heuristics (1999)
Keyphrases
- graph partitioning
- graph clustering
- partitioning algorithm
- normalized cut
- clustering algorithm
- equivalence classes
- graph model
- graph search
- weighted graph
- cluster analysis
- input space
- search algorithm
- depth first search
- data clustering
- graph theory
- spectral graph
- monte carlo
- multi dimensional
- low dimensional
- structured data
- random walk
- business intelligence
- graph representation
- maximum independent set
- dimensional vector
- prior knowledge
- dense subgraphs
- clustering scheme
- dynamic programming
- simulated annealing
- spanning tree
- graph databases
- document clustering
- hierarchical clustering
- tabu search
- graph mining
- directed acyclic graph
- vertex set
- vector space
- bipartite graph
- fuzzy clustering