An Algorithm for Discovery of New Families of Optimal Regular Networks.
Oleg G. MonakhovEmilia A. MonakhovaPublished in: Discovery Science (2003)
Keyphrases
- dynamic programming
- optimal solution
- computational complexity
- learning algorithm
- exhaustive search
- worst case
- high accuracy
- search space
- k means
- experimental evaluation
- times faster
- cost function
- segmentation algorithm
- matching algorithm
- np hard
- preprocessing
- simulated annealing
- globally optimal
- weighting coefficients
- linear programming
- input data
- particle swarm optimization
- expectation maximization
- ant colony optimization
- classification algorithm
- knowledge discovery
- path planning
- computational cost
- convex hull
- convergence rate
- reinforcement learning
- similarity measure
- operating point
- image segmentation