An Exact Pseudopolynomial Algorithm for a Problem of Finding a Family of Disjoint Subsets.
Alexandr E. GalashovAlexander KelmanovPublished in: DOOR (Supplement) (2016)
Keyphrases
- disjoint subsets
- times faster
- dynamic programming
- improved algorithm
- detection algorithm
- computational complexity
- similarity measure
- expectation maximization
- cost function
- learning algorithm
- k means
- preprocessing
- theoretical analysis
- single pass
- recognition algorithm
- convergence rate
- clustering method
- particle swarm optimization
- probabilistic model
- computational cost
- experimental evaluation
- search space
- input data
- denoising
- least squares
- search algorithm
- tree structure
- optimal solution
- memory requirements
- feature space
- objective function
- exact solution
- brute force
- np hard