105,678 research outputs found
Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm
This paper introduces ICET, a new algorithm for cost-sensitive
classification. ICET uses a genetic algorithm to evolve a population of biases
for a decision tree induction algorithm. The fitness function of the genetic
algorithm is the average cost of classification when using the decision tree,
including both the costs of tests (features, measurements) and the costs of
classification errors. ICET is compared here with three other algorithms for
cost-sensitive classification - EG2, CS-ID3, and IDX - and also with C4.5,
which classifies without regard to cost. The five algorithms are evaluated
empirically on five real-world medical datasets. Three sets of experiments are
performed. The first set examines the baseline performance of the five
algorithms on the five datasets and establishes that ICET performs
significantly better than its competitors. The second set tests the robustness
of ICET under a variety of conditions and shows that ICET maintains its
advantage. The third set looks at ICET's search in bias space and discovers a
way to improve the search.Comment: See http://www.jair.org/ for any accompanying file
Manifold Constrained Low-Rank Decomposition
Low-rank decomposition (LRD) is a state-of-the-art method for visual data
reconstruction and modelling. However, it is a very challenging problem when
the image data contains significant occlusion, noise, illumination variation,
and misalignment from rotation or viewpoint changes. We leverage the specific
structure of data in order to improve the performance of LRD when the data are
not ideal. To this end, we propose a new framework that embeds manifold priors
into LRD. To implement the framework, we design an alternating direction method
of multipliers (ADMM) method which efficiently integrates the manifold
constraints during the optimization process. The proposed approach is
successfully used to calculate low-rank models from face images, hand-written
digits and planar surface images. The results show a consistent increase of
performance when compared to the state-of-the-art over a wide range of
realistic image misalignments and corruptions
Optimal Sampling-Based Motion Planning under Differential Constraints: the Drift Case with Linear Affine Dynamics
In this paper we provide a thorough, rigorous theoretical framework to assess
optimality guarantees of sampling-based algorithms for drift control systems:
systems that, loosely speaking, can not stop instantaneously due to momentum.
We exploit this framework to design and analyze a sampling-based algorithm (the
Differential Fast Marching Tree algorithm) that is asymptotically optimal, that
is, it is guaranteed to converge, as the number of samples increases, to an
optimal solution. In addition, our approach allows us to provide concrete
bounds on the rate of this convergence. The focus of this paper is on mixed
time/control energy cost functions and on linear affine dynamical systems,
which encompass a range of models of interest to applications (e.g.,
double-integrators) and represent a necessary step to design, via successive
linearization, sampling-based and provably-correct algorithms for non-linear
drift control systems. Our analysis relies on an original perturbation analysis
for two-point boundary value problems, which could be of independent interest
- …