A Geometric Algorithm for Learning Oblique Decision Trees.
Naresh ManwaniP. S. SastryPublished in: PReMI (2009)
Keyphrases
- learning algorithm
- dynamic programming
- preprocessing
- search space
- worst case
- computational complexity
- np hard
- learning speed
- segmentation algorithm
- expectation maximization
- learning process
- objective function
- k means
- cost function
- artificial neural networks
- computational cost
- probabilistic model
- learning phase
- detection algorithm
- oblique decision trees
- e learning
- geometric constraints
- convergence rate
- similarity measure
- reinforcement learning
- simulated annealing
- multi class
- optimal solution
- machine learning