Minimization of Gini Impurity: NP-completeness and Approximation Algorithm via Connections with the k-means Problem.
Eduardo Sany LaberLucas MurtinhoPublished in: LAGOS (2019)
Keyphrases
- k means
- computational complexity
- preprocessing
- learning algorithm
- objective function
- data clustering
- detection algorithm
- np hard
- dynamic programming
- computational cost
- experimental evaluation
- polygonal approximation
- matching algorithm
- probabilistic model
- high accuracy
- convergence rate
- cost function
- data structure
- energy function
- error tolerance
- recognition algorithm
- error bounds
- times faster
- clustering method
- optimization algorithm
- segmentation algorithm
- theoretical analysis
- expectation maximization
- significant improvement