Using Transitional Bottlenecks to Improve Learning in Nearest Sequence Memory Algorithm.
Hüseyin AydinErkin ÇildenFaruk PolatPublished in: ICTAI (2017)
Keyphrases
- learning algorithm
- memory requirements
- optimization algorithm
- learning speed
- learning process
- learning phase
- matching algorithm
- significant improvement
- active learning
- computational complexity
- incremental learning
- objective function
- detection algorithm
- experimental evaluation
- probabilistic model
- online learning
- high accuracy
- convergence rate
- particle swarm optimization
- simulated annealing
- worst case
- dynamic programming
- np hard
- search space
- optimal solution
- input data
- genetic algorithm
- tree structure
- k means
- recognition algorithm
- similarity measure
- memory space
- e learning
- long sequences