Imbalanced-Free Memory Selection Scheme Based Continual Learning by Using K-means Clustering

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 169
  • Download : 0
Recently, continual learning is a new training strategy based on replaying memory and allowing beneficial effects to previous tasks. To preserve old information, current continual learning scheme accumulates observed examples into limited buffer or repeatedly trains generative model. This idea of learning scheme is effective to reduce catastrophic forgetting which is deterioration in overall performance when training sequentially. However, there still exists the problem of imbalanced data distribution in limited buffer and it is hard to apply on real-time system due to too long time to train both generative model and classification model. In this paper, we propose sample selection algorithm based on iterative k-means algorithm to improve the memory based continual learning. This approach selects examples to store into a buffer in a unsupervised manner using k-means cluster information. Our experiments on a variant of MNIST and CIFAR-100 datasets show the effects on classification accuracy performance when compared to the state-of-the-art.
Publisher
The korean institue of communications and information sciences (KICS)
Issue Date
2019-10-16
Language
English
Citation

10th International Conference on Information and Communication Technology Convergence (ICTC) - ICT Convergence Leading the Autonomous Future, pp.910 - 915

ISSN
2162-1233
DOI
10.1109/ICTC46691.2019.8939828
URI
http://hdl.handle.net/10203/268718
Appears in Collection
EE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0