On the number of iterations of the DBA algorithm.
Frederik BrüningAnne DriemelAlperen ErgürHeiko RöglinPublished in: SDM (2024)
Keyphrases
- computational complexity
- learning algorithm
- space complexity
- memory requirements
- k means
- small number
- search space
- input data
- optimization algorithm
- experimental evaluation
- detection algorithm
- tree structure
- matching algorithm
- times faster
- initial set
- clustering method
- execution times
- polynomial time complexity
- computational cost
- np hard
- cost function
- optimal solution
- objective function
- path planning
- data sets
- randomized algorithm
- databases
- decision trees
- cluster centers
- similarity measure
- database management
- worst case
- significant improvement
- business intelligence
- dynamic programming
- theoretical analysis
- particle swarm optimization