Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The U-curve optimization problem: improvements on the original algorithm
  and time complexity analysis   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, $\proc{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.

20
The categories of this paper are: acc-phys
23
The categories of this paper are: solv-int
17
The categories of this paper are: q-fin
3
The categories of this paper are: physics
25
The categories of this paper are: patt-sol
16
The categories of this paper are: stat
21
The categories of this paper are: adap-org
14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th
22
The categories of this paper are: chao-dyn
33
The categories of this paper are: plasm-ph
26
The categories of this paper are: bayes-an
31
The categories of this paper are: ao-sci
5
The categories of this paper are: gr-qc
2
The categories of this paper are: math
18
The categories of this paper are: econ