An Almost-Greedy Search on Random Binary Vectors and Random Graphs.
Avner DorEitan GreenshteinPublished in: J. Algorithms (2001)
Keyphrases
- random graphs
- greedy search
- binary vectors
- graph theoretic
- search space
- heuristic search
- binary features
- metaheuristic
- decision trees
- beam search
- simulated annealing
- dynamic programming
- phase transition
- computational efficiency
- global search
- search algorithm
- feature construction
- small world
- hill climbing
- learning algorithm
- undirected graph
- exhaustive search
- complex networks
- constraint satisfaction
- constraint satisfaction problems
- objective function
- machine learning