Enhancement of fraternal K-median algorithm with CNN for high dropout probabilities to evolve optimal time-complexity.
Nagaraj BalakrishnanArunkumar RajendranK. NisiPonnusamy VijayakumarPublished in: Clust. Comput. (2020)
Keyphrases
- worst case
- dynamic programming
- optimal solution
- computational complexity
- learning algorithm
- space complexity
- times faster
- optimal parameters
- computational cost
- experimental evaluation
- high accuracy
- preprocessing
- detection algorithm
- matching algorithm
- significant improvement
- k means
- high efficiency
- convergence rate
- theoretical analysis
- segmentation algorithm
- closed form
- image processing
- np hard
- globally optimal
- bayesian networks
- optimization algorithm
- expectation maximization
- linear programming
- scheduling problem
- probabilistic model
- cost function