A CLASSIFICATION ALGORITHM WITH LINEAR DISCRIMINANT ANALYSIS AND AXIOMATIC FUZZY SETS

15Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

In exploratory data mining, most classifiers pay more attention on the accuracy and speed of learned models, but they are lacking of the interpretability. In this paper, an interpretable and comprehensible classifier is proposed based on Linear Discriminant Analysis (LDA) and Axiomatic Fuzzy Sets (AFS). The algorithm utilizes LDA to extract features with the largest inter-class variance. Besides, the proposed approach aims to explore a transformation from the selected feature space to a semantic space where the samples in the same class are made as close as possible to one another, whereas the samples in the different class are as far as possible from one another. Moreover, the descriptions of each class can be obtained by the proposed approach. When compared with well-known classifiers such as LogisticR, C4.5Tree, SVM and KNN, the proposed method not only can achieve better performance in terms of accuracy but also has the capability of interpretability and comprehension.

Cite

CITATION STYLE

APA

Jia, W., Deng, Y., Xin, C., Liu, X., & Pedrycz, W. (2019). A CLASSIFICATION ALGORITHM WITH LINEAR DISCRIMINANT ANALYSIS AND AXIOMATIC FUZZY SETS. Mathematical Foundations of Computing, 2(1), 73–81. https://doi.org/10.3934/mfc.2019006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free