Dynamic Version of the ACDT/ACDF Algorithm for H-Bond Data Set Analysis.
Jan KozakUrszula BoryczkaPublished in: ICCCI (2013)
Keyphrases
- data sets
- detection algorithm
- optimization algorithm
- computational cost
- significant improvement
- optimal solution
- computational complexity
- search space
- experimental evaluation
- dynamic programming
- improved algorithm
- recognition algorithm
- times faster
- particle swarm optimization
- input data
- worst case
- np hard
- cost function
- k means
- lower bound
- data analysis
- learning algorithm
- probabilistic model
- evolutionary algorithm
- simulated annealing
- preprocessing
- segmentation algorithm
- training data
- clustering method
- tree structure
- real world
- neural network