PRICAI
2000
Springer
13 years 8 months ago
2000
Springer
While the decision tree is an effective representation that has been used in many domains, a tree can often encode a concept inefficiently. This happens when the tree has to repres...
IDEAL
2000
Springer
13 years 8 months ago
2000
Springer
Quantization of continuous variables is important in data analysis, especially for some model classes such as Bayesian networks and decision trees, which use discrete variables. Of...
AIMSA
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. Decision trees are considered as an efficient technique to express classification knowledge and to use it. However, their most standard algorithms do not deal with uncert...
ECML
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In some learning settings, the cost of acquiring features for classification must be paid up front, before the classifier is evaluated. In this paper, we introduce the fo...
COCO
2006
Springer
13 years 8 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
ADMA
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
ICIP
2007
IEEE
13 years 8 months ago
2007
IEEE
1 In this paper, we propose the use of data mining algorithms to create a macroblock partition mode decision algorithm for inter-frame prediction, to be used as part of a high-effi...
CIDM
2009
IEEE
13 years 8 months ago
2009
IEEE
Abstract-- Automatic recognition of activities using time series data collected from exercise can facilitate development of applications that motivate people to exercise more frequ...
STOC
1992
ACM
13 years 8 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
ECML
1997
Springer
13 years 8 months ago
1997
Springer
We investigate an inherent limitation of top-down decision tree induction in which the continuous partitioning of the instance space progressively lessens the statistical support o...