Sciweavers

1683 search results - page 101 / 337
» Learning with Mixtures of Trees
Sort
View
FLAIRS
2006
13 years 10 months ago
Generalized Entropy for Splitting on Numerical Attributes in Decision Trees
Decision Trees are well known for their training efficiency and their interpretable knowledge representation. They apply a greedy search and a divide-and-conquer approach to learn...
Mingyu Zhong, Michael Georgiopoulos, Georgios C. A...
JCM
2006
95views more  JCM 2006»
13 years 9 months ago
A Learning-based Adaptive Routing Tree for Wireless Sensor Networks
One of the most common communication patterns in sensor networks is routing data to a base station, while the base station can be either static or mobile. Even in static cases, a s...
Ying Zhang, Qingfeng Huang
JMLR
2002
102views more  JMLR 2002»
13 years 9 months ago
Efficient Algorithms for Decision Tree Cross-validation
Cross-validation is a useful and generally applicable technique often employed in machine learning, including decision tree induction. An important disadvantage of straightforward...
Hendrik Blockeel, Jan Struyf
ICML
2006
IEEE
14 years 10 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan
COLT
1989
Springer
14 years 1 months ago
Learning in the Presence of Inaccurate Information
The present paper considers the effects of introducing inaccuracies in a learner’s environment in Gold’s learning model of identification in the limit. Three kinds of inaccu...
Mark A. Fulk, Sanjay Jain