Fast online SVDD based on support vectors merging
| Autor: | Jian-Ling Qu, Yuchuan Qiao, Lu Yu, Yazhou Di, Xiao-Fei Wang |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
0209 industrial biotechnology
Training set Computer science business.industry Online learning Pattern recognition 02 engineering and technology Novelty detection Data description Support vector machine 020901 industrial engineering & automation Initial training 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Artificial intelligence business Classifier (UML) MNIST database |
| Zdroj: | ICACI |
| DOI: | 10.1109/icaci.2018.8377606 |
| Popis: | Online support vector data description (SVDD) performs excellently when dealing with novelty detection problems. This method only uses the support vectors (SVs) as an initial training set and incrementally updates the SVDD classifier when receiving new samples. Therefore, as the SVs number tends to grow along with the number of training samples, the update time grows exponentially. To tackle this problem, we propose a new online SVDD method based on SVs merging procedure in this paper. SVs merging procedure bound the size of training set during online learning, thus the proposed method maintains a constant update time. Experimental results of the banana datasets, Mnist datasets and Cifar 10 datasets show that the proposed method achieves higher training speed than both the canonical online SVDD method and the incremental SVDD method, while maintaining a comparable classification accuracy. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|