Home > Research > Publications & Outputs > Autonomously evolving classifier TEDAClass

Electronic data

  • TEDAClass

    Rights statement: This is the author’s version of a work that was accepted for publication in Information Sciences. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Information Sciences, 366, 2016 DOI: 10.1016/j.ins.2016.05.012

    Accepted author manuscript, 248 KB, PDF document

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

Links

Text available via DOI:

View graph of relations

Autonomously evolving classifier TEDAClass

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published
<mark>Journal publication date</mark>20/10/2016
<mark>Journal</mark>Information Sciences
Volume366
Number of pages11
Pages (from-to)1-11
Publication StatusPublished
Early online date24/05/16
<mark>Original language</mark>English

Abstract

Abstract In this paper we introduce a classifier named TEDAClass (Typicality and Eccentricity based Data Analytics Classifier) which is based on the recently proposed AnYa type fuzzy rule based system. Specifically, the rules of the proposed classifier are defined according to the recently proposed TEDA framework. This novel and efficient systematic methodology for data analysis is a promising addition to the traditional probability as well as to the fuzzy logic. It is centred at non-parametric density estimation derived from the data sample. In addition, the proposed framework is computationally cheap and provides fast and exact per-point processing of the data set/stream. The algorithm is demonstrated to be suitable for different classification tasks. Throughout the paper we give evidence of its applicability to a wide range of practical problems. Furthermore, the algorithm can be easily adapted to different classical data analytics problems, such as clustering, regression, prediction, and outlier detection. Finally, it is very important to remark that the proposed algorithm can work “from scratch” and evolve its structure during the learning process.

Bibliographic note

This is the author’s version of a work that was accepted for publication in Information Sciences. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Information Sciences, 366, 2016 DOI: 10.1016/j.ins.2016.05.012