MLLGJun 7, 2018

Feature selection in functional data classification with recursive maxima hunting

arXiv:1806.02922v17 citations
Originality Incremental advance
AI Analysis

This work addresses dimensionality reduction for classification with functional data, which is an incremental improvement over existing feature selection methods.

The authors tackled feature selection in functional data classification by introducing recursive maxima hunting (RMH), which recursively identifies maxima of a relevance function and removes selected variable information. The results showed that RMH achieved comparable or higher predictive accuracy than standard techniques like PCA and PLS, as well as state-of-the-art methods such as maxima hunting, in the problems investigated.

Dimensionality reduction is one of the key issues in the design of effective machine learning methods for automatic induction. In this work, we introduce recursive maxima hunting (RMH) for variable selection in classification problems with functional data. In this context, variable selection techniques are especially attractive because they reduce the dimensionality, facilitate the interpretation and can improve the accuracy of the predictive models. The method, which is a recursive extension of maxima hunting (MH), performs variable selection by identifying the maxima of a relevance function, which measures the strength of the correlation of the predictor functional variable with the class label. At each stage, the information associated with the selected variable is removed by subtracting the conditional expectation of the process. The results of an extensive empirical evaluation are used to illustrate that, in the problems investigated, RMH has comparable or higher predictive accuracy than the standard dimensionality reduction techniques, such as PCA and PLS, and state-of-the-art feature selection methods for functional data, such as maxima hunting.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes