On Algorithm for Constructing of Decision Trees with Minimal Number of Nodes.
Igor ChikalovPublished in: Rough Sets and Current Trends in Computing (2000)
Keyphrases
- computational complexity
- detection algorithm
- memory requirements
- dynamic programming
- optimization algorithm
- decision trees
- cost function
- graph structure
- space complexity
- objective function
- computational cost
- times faster
- segmentation algorithm
- k means
- high accuracy
- convergence rate
- directed graph
- matching algorithm
- classification algorithm
- decision tree algorithm
- particle swarm optimization
- expectation maximization
- simulated annealing
- worst case
- np hard
- preprocessing
- similarity measure
- machine learning
- small number
- significant improvement
- evolutionary algorithm
- search space
- undirected graph
- path length
- fully connected
- randomized algorithm