Sciweavers

2090 search results - page 56 / 418
» Learning with attribute costs
Sort
View
CIKM
2005
Springer
14 years 2 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
ICML
2003
IEEE
14 years 9 months ago
Decision-tree Induction from Time-series Data Based on a Standard-example Split Test
This paper proposes a novel decision tree for a data set with time-series attributes. Our time-series tree has a value (i.e. a time sequence) of a time-series attribute in its int...
Yuu Yamada, Einoshin Suzuki, Hideto Yokoi, Katsuhi...
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
14 years 3 months ago
Spatio-temporal Multi-dimensional Relational Framework Trees
—The real world is composed of sets of objects that move and morph in both space and time. Useful concepts can be defined in terms of the complex interactions between the multi-...
Matthew Bodenhamer, Samuel Bleckley, Daniel Fennel...
ICML
1999
IEEE
14 years 9 months ago
Making Better Use of Global Discretization
Before applying learning algorithms to datasets, practitioners often globally discretize any numeric attributes. If the algorithm cannot handle numeric attributes directly, prior ...
Eibe Frank, Ian H. Witten
ESANN
2006
13 years 10 months ago
Variants of Unsupervised Kernel Regression: General cost functions
We present an extension to a recent method for learning of nonlinear manifolds, which allows to incorporate general cost functions. We focus on the -insensitive loss and visually d...
Stefan Klanke, Helge Ritter