In this region, the values attained by the neighboring states are the same. Momentum enables the hill-climbing algorithm to take huge steps that will make it move past the local maximum. This technique adds a certain proportion (m) of the initial weight to the current one. This problem can be solved using momentum. This will lead to the hill-climbing process’s termination, even though this is not the best possible solution. The greedy approach feature will not move the algorithm to a worse off state. Local maximumĪt this point, the neighboring states have lower values than the current state. There are three regions in which a hill-climbing algorithm cannot attain a global maximum or the optimal solution: local maximum, ridge, and plateau.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |