An algorithm of polynomial order for computing the covering dimension of a finite space.
Dimitris N. GeorgiouAthanasios C. MegaritisPublished in: Appl. Math. Comput. (2014)
Keyphrases
- high accuracy
- times faster
- experimental evaluation
- computational complexity
- learning algorithm
- objective function
- improved algorithm
- search space
- cost function
- computational cost
- polynomially bounded
- dimensional data
- detection algorithm
- theoretical analysis
- computationally efficient
- significant improvement
- similarity measure
- worst case
- dynamic programming
- tree structure
- k means
- parameter space
- preprocessing
- polynomial size
- clustering algorithm