paper-with-me

홈 › Papers

Evaluating Nonlinear Decision Trees for Binary Classification Tasks with Other Existing Methods

2020-08-25 · Yashesh Dhebar, Sparsh Gupta, Kalyanmoy Deb

Classification of datasets into two or more distinct classes is an important machine learning task. Many methods are able to classify binary classification tasks with a very high accuracy on test data, but cannot provide any easily interpretable explanation for users to have a deeper understanding of reasons for the split of data into two classes. In this paper, we highlight and evaluate a recently proposed nonlinear decision tree approach with a number of commonly used classification methods on a number of datasets involving a few to a large number of features. The study reveals key issues such as effect of classification on the method's parameter values, complexity of the classifier versus achieved accuracy, and interpretability of resulting classifiers.

📄 PDF Abstract BibTeX arXiv:2008.10753

Code (0)

등록된 구현이 없습니다.

Tasks

Binary ClassificationClassificationGeneral Classification

Methods 이 논문이 사용한 방법론

Interpretability 설명 없음

Similar Papers 제목 키워드 기반

Optimal Decision Trees for Nonlinear Metrics

2020-09-15 · Emir Demirović, Peter J. Stuckey

Nonlinear metrics, such as the F1-score, Matthews correlation coefficient, and Fowlkes-Mallows index, are often used to evaluate the performance of machine learning models, in particular, when facing imbalanced datasets …

On the Trade-off between the Number of Nodes and the Number of Trees in a Random Forest

2023-12-16 · Tatsuya Akutsu, Avraham A. Melkman, Atsuhiro Takasu

In this paper, we focus on the prediction phase of a random forest and study the problem of representing a bag of decision trees using a smaller bag of decision trees, where we only consider binary decision problems on t…

ODTE -- An ensemble of multi-class SVM-based oblique decision trees

2024-11-20 · Ricardo Montañana, José A. Gámez, José M. Puerta

We propose ODTE, a new ensemble that uses oblique decision trees as base classifiers. Additionally, we introduce STree, the base algorithm for growing oblique decision trees, which leverages support vector machines to de…

Binary Classification

Sparse learning with CART

2020-06-07 · NeurIPS 2020 12 · Jason M. Klusowski

Decision trees with binary splits are popularly constructed using Classification and Regression Trees (CART) methodology. For regression models, this approach recursively divides the data into two near-homogenous daughte…

regressionSparse Learning

Extracting PAC Decision Trees from Black Box Binary Classifiers: The Gender Bias Study Case on BERT-based Language Models

2024-12-13 · Ana Ozaki, Roberto Confalonieri, Ricardo Guimarães, Anders Imenes

Decision trees are a popular machine learning method, known for their inherent explainability. In Explainable AI, decision trees can be used as surrogate models for complex black box AI models or as approximations of par…

Binary Classification