Loading

Robust Classification using Twosome Classifier
Roshani Raut
Dr. Roshani Raut*, Department of Computer Engineering, Vishwakarma Institute of Information Technology, SPPU, Pune, India. 

Manuscript received on January 02, 2020. | Revised Manuscript received on January 15, 2020. | Manuscript published on January 30, 2020. | PP: 2505-2508 | Volume-8 Issue-5, January 2020. | Retrieval Number: E6512018520/2020©BEIESP | DOI: 10.35940/ijrte.E6512.018520
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: The proficient knowledge revolution with the concept class detection is a significant challenge for the incremental learning classification, here the batch of data is flowing unremittingly. The algorithm recommended in this research learns continual raw data, transform preceding knowledge to the present data without stating to the longstanding data and able to proficiently allow new concept class noticed by the classification. A major aim was knowledge transformation and the accumulation of the same with concept class detection in the incremental data flow. After the analysis of non-incremental ML approaches for classification and incremental learning algorithms in the literature, this research introduces new incremental learning algorithm, which uses twosome classifiers, in which knowledge transformation and new class detection have been done efficiently. The performance of the system is validated using simulation results on available datasets. The class wise and batch wise accuracy is calculated. The projected technique is also used to detect concept class detection.
Keywords: Incremental Learning, Ensemble Learning, Voting Scheme, Concept Class, Classifiers.
Scope of the Article: Classification.