Improvements to the Helpful-Set Algorithm and a New Evaluation Scheme for Graph-Partitioners.
Stefan SchambergerPublished in: ICCSA (3) (2003)
Keyphrases
- detection algorithm
- learning algorithm
- preprocessing
- np hard
- random walk
- undirected graph
- shortest path problem
- input data
- tree structure
- directed graph
- k means
- computational complexity
- objective function
- convex hull
- search space
- segmentation algorithm
- graph model
- dominating set
- input pattern
- maximum flow
- dependency graph
- polynomial time approximation
- polynomial time complexity
- expectation maximization
- particle swarm optimization
- cost function
- optimal solution
- solution space
- image set
- graph clustering
- worst case
- semi supervised
- dynamic programming
- similarity measure