A One-Class Decision Tree Based on Kernel Density Estimation

05/14/2018
by   Sarah Itani, et al.
0

One-Class Classification (OCC) is a domain of machine learning which achieves training by means of a single class sample. The present work aims at developing a one-class model which addresses concerns of both performance and readability. To this end, we propose a hybrid OCC method which relies on density estimation as part of a tree-based learning algorithm. Within a greedy and recursive approach, our proposal rests on kernel density estimation to split a data subset on the basis of one or several intervals of interest. Our method shows favorable performance in comparison with common methods of the literature on a range of benchmark datasets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2020

New Nearly-Optimal Coreset for Kernel Density Estimation

Given a point set P⊂ℝ^d, kernel density estimation for Gaussian kernel i...
research
10/14/2016

Simultaneous Learning of Trees and Representations for Extreme Classification and Density Estimation

We consider multi-class classification where the predictor has a hierarc...
research
10/25/2021

Kernel density estimation-based sampling for neural network classification

Imbalanced data occurs in a wide range of scenarios. The skewed distribu...
research
08/25/2020

Multiple-Source Adaptation with Domain Classifiers

We consider the multiple-source adaptation (MSA) problem and improve a p...
research
03/09/2016

Optimized Kernel Entropy Components

This work addresses two main issues of the standard Kernel Entropy Compo...
research
06/03/2019

Temporal Density Extrapolation using a Dynamic Basis Approach

Density estimation is a versatile technique underlying many data mining ...
research
08/01/2022

Learning Transfer Operators by Kernel Density Estimation

Inference of transfer operators from data is often formulated as a class...

Please sign up or login with your details

Forgot password? Click here to reset