A Simplification Algorithm for Visualizing the Structure of Complex Graphs.
Daniel HennesseyDaniel BrooksAlex FridmanDavid E. BreenPublished in: IV (2008)
Keyphrases
- learning algorithm
- graph structure
- preprocessing
- cost function
- times faster
- np hard
- experimental evaluation
- computational complexity
- dynamic programming
- computational cost
- detection algorithm
- high accuracy
- directed acyclic
- graph partitioning
- tree structure
- clustering method
- simulated annealing
- probabilistic model
- objective function
- expectation maximization
- particle swarm optimization
- matching algorithm
- search space
- convergence rate
- association rules
- computationally intensive
- optimal solution