arXiv:2106.00387
Decision Concept Lattice vs. Decision Trees and Random Forests
원문 초록
Decision trees and their ensembles are very popular models of supervised machine learning. In this paper we merge the ideas underlying decision trees, their ensembles and FCA by proposing a new supervised machine learning model which can be constructed in polynomial time and is applicable for both classification and regression problems. Specifically, we first propose a polynomial-time algorithm for constructing a part of the concept lattice that is based on a decision tree. Second, we describe a prediction scheme based on a concept lattice for solving both classification and regression tasks with prediction quality comparable to that of state-of-the-art models.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
An Interpretable Adaptive Multiscale Attention Deep Neural Network for Tabular Data
Open-World Social Event Classification
SONNET: A Self-Guided Ordinal Regression Neural Network for Segmentation and Classification of Nuclei in Large-Scale Multi-Tissue Histology Images
Gaussian Process Regression With Interpretable Sample-Wise Feature Weights
A Machine Learning Approach for Employee Retention Prediction
Analysis of Kepler Objects of Interest using Machine Learning for Exoplanet Identification
토론
이 논문과 연결된 포럼 글이 아직 없습니다.