An Unsupervised Learning Classifier with Competitive Error Performance

06/25/2018 ∙ by Daniel N. Nissani, et al. ∙ 0

An unsupervised learning classification model is described. It achieves classification error probability competitive with that of state-of-the-art supervised learning classifiers such as SVM or kNN. The model is based on the incremental execution of small step shift and rotation operations upon selected discriminative hyperplanes at the arrival of input samples. When applied, in conjunction with a selected feature extractor, to a subset of the ImageNet dataset benchmark, it yields 6.2 merely about 2 using same feature extractor. This result may also be contrasted with popular unsupervised learning schemes such as k-Means which is shown to be practically useless on same dataset.



There are no comments yet.


This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.