127 search results - page 16 / 26 » Learning Monotone Decision Trees in Polynomial Time |
86
Voted
IJHCI
2010
14 years 10 months ago
2010
Motivation – Investigations of large-scale outages in the North American interconnected electric system often attribute the causes to three T’s: Trees, Training and Tools. To ...
104
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
88
Voted
CIS
2004
Springer
15 years 5 months ago
2004
Springer
Concept drifting in data streams often occurs unpredictably at any time. Currently many classification mining algorithms deal with this problem by using an incremental learning ap...
AAAI
1996
15 years 1 months ago
1996
We formalize a model for supervised learning of action strategies in dynamic stochastic domains and show that PAC-learning results on Occam algorithms hold in this model as well. W...
IPL
2010
14 years 10 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...