Sub-Setting Algorithm for Training Data Selection in Pattern Recognition

10/13/2021
by   AGaurav Arwade, et al.
0

Modern pattern recognition tasks use complex algorithms that take advantage of large datasets to make more accurate predictions than traditional algorithms such as decision trees or k-nearest-neighbor better suited to describe simple structures. While increased accuracy is often crucial, less complexity also has value. This paper proposes a training data selection algorithm that identifies multiple subsets with simple structures. A learning algorithm trained on such a subset can classify an instance belonging to the subset with better accuracy than the traditional learning algorithms. In other words, while existing pattern recognition algorithms attempt to learn a global mapping function to represent the entire dataset, we argue that an ensemble of simple local patterns may better describe the data. Hence the sub-setting algorithm identifies multiple subsets with simple local patterns by identifying similar instances in the neighborhood of an instance. This motivation has similarities to that of gradient boosted trees but focuses on the explainability of the model that is missing for boosted trees. The proposed algorithm thus balances accuracy and explainable machine learning by identifying a limited number of subsets with simple structures. We applied the proposed algorithm to the international stroke dataset to predict the probability of survival. Our bottom-up sub-setting algorithm performed on an average 15 top-down decision tree learned on the entire dataset. The different decision trees learned on the identified subsets use some of the previously unused features by the whole dataset decision tree, and each subset represents a distinct population of data.

READ FULL TEXT

page 1

page 10

page 15

research
02/24/2022

Interfering Paths in Decision Trees: A Note on Deodata Predictors

A technique for improving the prediction accuracy of decision trees is p...
research
11/26/2022

Mixture of Decision Trees for Interpretable Machine Learning

This work introduces a novel interpretable machine learning method calle...
research
10/26/2020

An Approach to Evaluating Learning Algorithms for Decision Trees

Learning algorithms produce software models for realising critical class...
research
08/19/2021

Simple is better: Making Decision Trees faster using random sampling

In recent years, gradient boosted decision trees have become popular in ...
research
03/22/2016

A Selection of Giant Radio Sources from NVSS

Results of the application of pattern recognition techniques to the prob...
research
07/03/2023

Systematic Bias in Sample Inference and its Effect on Machine Learning

A commonly observed pattern in machine learning models is an underpredic...

Please sign up or login with your details

Forgot password? Click here to reset