In Case of Interval (or More General) Uncertainty, No Algorithm Can Choose the Simplest Representative.
Gerhard HeindlVladik KreinovichMaria RifqiPublished in: Reliab. Comput. (2002)
Keyphrases
- dynamic programming
- improved algorithm
- times faster
- special case
- theoretical analysis
- worst case
- np hard
- detection algorithm
- segmentation algorithm
- cost function
- selection algorithm
- learning algorithm
- probabilistic model
- optimization algorithm
- single pass
- computationally efficient
- clustering method
- simulated annealing
- experimental evaluation
- significant improvement
- preprocessing
- objective function
- computational complexity
- data sets
- neural network
- decision trees
- recognition algorithm
- uncertain data
- similarity measure
- tree structure
- computational cost
- search space
- k means
- input data
- high accuracy