Sciweavers

510 search results - page 6 / 102
» Complexity measures and decision tree complexity: a survey
Sort
View
IJCSS
2000
79views more  IJCSS 2000»
13 years 8 months ago
Impact of learning set quality and size on decision tree performances
Abstract. The quality of a decision tree is usually evaluated through its complexity and its generalization accuracy. Tree-simpli
Marc Sebban, Richard Nock, Jean-Hugues Chauchat, R...
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
14 years 26 days ago
Optimizing the Induction of Alternating Decision Trees
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
Bernhard Pfahringer, Geoffrey Holmes, Richard Kirk...
AAAI
2006
13 years 9 months ago
A Fast Decision Tree Learning Algorithm
There is growing interest in scaling up the widely-used decision-tree learning algorithms to very large data sets. Although numerous diverse techniques have been proposed, a fast ...
Jiang Su, Harry Zhang
ICASSP
2010
IEEE
13 years 8 months ago
Morphological wavelets and the complexity of dyadic trees
In this paper we reveal a connection between the coefficients of the morphological wavelet transform and complexity measures of dyadic tree representations of level sets. This le...
Zhen James Xiang, Peter J. Ramadge
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
14 years 1 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz