Classification of Dangerous Situations for Small Sample Size Problem in Maintenance Decision Support Systems
In this paper we examine the task of maintenance decision support in classification of the dangerous situations discovered by the monitoring system. This task is reduced to the contextual multi-armed bandit problem. We highlight the small sample size problem appeared in this task due to the rather rare failures. The novel algorithm based on the nearest neighbor search is proposed. An experimental study is provided for several synthetic datasets with the situations described by either simple features or grayscale images. It is shown, that our algorithm outperforms the well-known contextual multi-armed methods with the Upper Confidence Bound and softmax stochastic search strategies.
KeywordsMaintenance decision support systems Classification Small sample size problem Nearest neighbor Contextual multi-armed bandit
- 8.Szegedy, C., Liu, W., Jia, Y., Sermanet, P., Reed, S., Anguelov, D., Erhan, D., Vanhoucke, V., Rabinovich, A.: Going deeper with convolutions. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1–9 (2015)Google Scholar
- 9.Chernousov, V.O., Savchenko, A.V.: A fast mathematical morphological algorithm of video-based moving forklift truck detection in noisy environment. In: Ignatov, D.I., Khachay, M.Y., Panchenko, A., Konstantinova, N., Yavorskiy, Rostislav, E. (eds.) AIST 2014. CCIS, vol. 436, pp. 57–65. Springer, Heidelberg (2014). doi:10.1007/978-3-319-12580-0_5 Google Scholar
- 10.Sonka, M., Hlavac, V., Boyle, R.: Image Processing, Analysis, and Machine Vision, 4th edn. Cengage Learning, Stamford (2014)Google Scholar