The U-curve optimization problem: improvements on the original algorithm and time complexity analysis

07/22/2014
by   Marcelo S. Reis, et al.
0

The U-curve optimization problem is characterized by a decomposable in U-shaped curves cost function over the chains of a Boolean lattice. This problem can be applied to model the classical feature selection problem in Machine Learning. Recently, the U-Curve algorithm was proposed to give optimal solutions to the U-curve problem. In this article, we point out that the U-Curve algorithm is in fact suboptimal, and introduce the U-Curve-Search (UCS) algorithm, which is actually optimal. We also present the results of optimal and suboptimal experiments, in which UCS is compared with the UBB optimal branch-and-bound algorithm and the SFFS heuristic, respectively. We show that, in both experiments, UCS had a better performance than its competitor. Finally, we analyze the obtained results and point out improvements on UCS that might enhance the performance of this algorithm.

READ FULL TEXT
research
10/30/2008

A branch-and-bound feature selection algorithm for U-shaped cost functions

This paper presents the formulation of a combinatorial optimization prob...
research
03/12/2021

Search of fractal space-filling curves with minimal dilation

We introduce an algorithm for a search of extremal fractal curves in lar...
research
05/03/2007

Multiresolution Approximation of Polygonal Curves in Linear Complexity

We propose a new algorithm to the problem of polygonal curve approximati...
research
07/29/2021

Quasi-genetic algorithms and continuation Newton methods with deflation techniques for global optimization problems

The global minimum point of an optimization problem is of interest in en...
research
01/23/2018

Onion Curve: A Space Filling Curve with Near-Optimal Clustering

Space filling curves (SFCs) are widely used in the design of indexes for...
research
01/26/2020

Learning the Hypotheses Space from data Part I: Learning Space and U-curve Property

The agnostic PAC learning model consists of: a Hypothesis Space H, a pro...
research
06/05/2020

An adaptive iterative/subdivision hybrid algorithm for curve/curve intersection

The behavior of the iterative/subdivision hybrid algorithm for curve/cur...

Please sign up or login with your details

Forgot password? Click here to reset