An Interpretable Classification Model Based on Characteristic Element Extraction
Authors: 
Mingwei Zhang, Xiuxiu He, Bin ZhangAuthors Info & Claims
Mingwei Zhang, Xiuxiu He, Bin ZhangAuthors Info & ClaimsPages 344 - 349
Abstract
The process of a classification application is usually dynamic and long. During the process of an application, better classification application effect can be acquired by enlarging and adjusting the training dataset continuously, for example, modifying the wrong labels of original instances. For this kind of dynamic classification applications, how to build an interpretable classifier which can help domain experts to understand each label's meanings reflected from the dataset, then to compare and discriminate them with their own mastered domain knowledge, and finally to adjust and optimize the training set to enhance the effect of classification applications, is a neglected but worth studying issue. Therefore, an interpretable classification model based on characteristic element extraction is proposed in this paper. The proposed classifier is constructed by extracting positive and negative characteristic elements for all class labels which can intuitively reflect their instinct characteristics. Thus, it has high interpretability obviously and can effectively help domain experts optimize classification effect. At the same time, experiment results show that our classifier also has higher accuracy compared with other kinds of classical classifiers. Consequently, the classification model proposed in this paper is effective and efficient, especially in practical applications.
References
[1]
Fernandez-Delgado, M., Cernadas, E., Barro, S. and Amorim, D. G. 2014. Do we Need Hundreds of Classifiers to Solve Real World Classification Problems?. Journal of Machine Learning Research. 15, 1, 3133--3181.
[2]
Li, Y., Zhang, L., Xu, Y., Yao, Y., Lau, R. Y. and Wu, Y. 2017. Enhancing Binary Classification by Modeling Uncertain Boundary in Three-Way Decisions. IEEE Transactions on Knowledge and Data Engineering. 29, 7, 1438--1451.
[3]
Takenouchi, T. and Ishii, S. 2018. Binary classifiers ensemble based on Bregman divergence for multi-class classification. Neurocomputing. 273, 1, 424--434.
[4]
Tagami, Y. 2017. AnnexML: Approximate Nearest Neighbor Search for Extreme Multi-label Classification. In Proceedings of the 23rd International Conference on Knowledge Discovery and Data Mining (SIGKDD). ACM, New York, 455--464.
[5]
Li, Y. and Dixit, M., Vasconcelos, N. 2017. Deep Scene Image Classification with the MFAFVNet. In Proceedings of International Conference on Computer Vision (ICCV). IEEE, Washington, 5757--5765.
[6]
Wu, W., Li, B., Chen, L., Zhu, X. and Zhang, C. 2018. K-Ary Tree Hashing for Fast Graph Classification. IEEE Transactions on Knowledge and Data Engineering. 30, 5, 936--949.
[7]
Li, Y. and Ye, J. 2018. Learning Adversarial Networks for Semi-Supervised Text Classification via Policy Gradient. In Proceedings of the 24th International Conference on Knowledge Discovery and Data Mining (SIGKDD). ACM, New York, 1715--1723.
[8]
Tai, K. S., Sharan, V., Bailis, P. and Valiant, G. 2018. Sketching Linear Classifiers over Data Streams. In Proceedings of the International Conference on Management of Data (SIGMOD). ACM, New York, 757--772.
[9]
Wu, O. 2018. Classifier Ensemble by Exploring Supplementary Ordering Information. IEEE Transactions on Knowledge and Data Engineering. 30, 11, 2065--2077.
Index Terms
- An Interpretable Classification Model Based on Characteristic Element Extraction
Recommendations
A Combined Classification Algorithm Based on C4.5 and NB
ISICA '08: Proceedings of the 3rd International Symposium on Advances in Computation and IntelligenceWhen our learning task is to build a model with accurate classification, C4.5 and NB are two very important algorithms for achieving this task because of their simplicity and high performance. In this paper, we present a combined classification ...
An interpretable classification rule mining algorithm
Obtaining comprehensible classifiers may be as important as achieving high accuracy in many real-life applications such as knowledge discovery tools and decision support systems. This paper introduces an efficient Evolutionary Programming algorithm for ...
Hybrid decision tree and naïve Bayes classifiers for multi-class classification tasks
In this paper, we introduce two independent hybrid mining algorithms to improve the classification accuracy rates of decision tree (DT) and naive Bayes (NB) classifiers for the classification of multi-class problems. Both DT and NB classifiers are ...
Comments
Information & Contributors
Information
Published In
February 2019
563 pages
ISBN:9781450366007
DOI:10.1145/3318299
Copyright © 2019 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
In-Cooperation
- Southwest Jiaotong University
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 22 February 2019
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ICMLC '19
ICMLC '19: 2019 11th International Conference on Machine Learning and Computing
February 22 - 24, 2019
Zhuhai, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 72Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 18 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in