LGAIMLNov 7, 2016

Reinforcement Learning Approach for Parallelization in Filters Aggregation Based Feature Selection Algorithms

arXiv:1611.02047v1
Originality Synthesis-oriented
AI Analysis

This work addresses the need for faster and more effective feature selection in machine learning and data mining, though it appears incremental as it builds on the existing MeLiF algorithm.

The paper tackled the problem of improving the speed and performance of the MeLiF feature selection algorithm by proposing two parallelization schemes, which significantly enhanced algorithm performance and increased feature selection quality.

One of the classical problems in machine learning and data mining is feature selection. A feature selection algorithm is expected to be quick, and at the same time it should show high performance. MeLiF algorithm effectively solves this problem using ensembles of ranking filters. This article describes two different ways to improve MeLiF algorithm performance with parallelization. Experiments show that proposed schemes significantly improves algorithm performance and increase feature selection quality.

Foundations

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

Your Notes