A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm.
Kozo SugiyamaKazuo MisuePublished in: Graph Drawing (1994)
Keyphrases
- feature space
- input data
- high accuracy
- significant improvement
- preprocessing
- clustering method
- detection algorithm
- objective function
- detection method
- experimental evaluation
- cost function
- dynamic programming
- improved algorithm
- optimization algorithm
- hyper graph
- computational cost
- k means
- recognition algorithm
- segmentation method
- single pass
- computational complexity
- segmentation algorithm
- tree structure
- matching algorithm
- estimation algorithm
- support vector machine svm
- em algorithm
- optimization method
- classification method
- computationally efficient
- synthetic and real images
- adjacency graph
- high efficiency
- mathematical model
- convergence rate
- classification algorithm
- similarity measure
- energy function
- probabilistic model
- computational efficiency
- selection algorithm
- learning algorithm
- expectation maximization
- simulated annealing
- minimum spanning tree
- subgraph isomorphism
- np hard
- combinatorial optimization
- pairwise
- optimal solution
- search space