459 search results - page 9 / 92 » Average Case Analysis of Conjunctive Learning Algorithms |
103
click to vote
CIDM
2009
IEEE
15 years 3 months ago
2009
IEEE
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
112
click to vote
COLT
2007
Springer
15 years 5 months ago
2007
Springer
Bounded parameter Markov Decision Processes (BMDPs) address the issue of dealing with uncertainty in the parameters of a Markov Decision Process (MDP). Unlike the case of an MDP, t...
TASLP
2008
14 years 11 months ago
2008
Source separation of musical signals is an appealing but difficult problem, especially in the single-channel case. In this paper, an unsupervised single-channel music source separa...
AI
1998
Springer
14 years 11 months ago
1998
Springer
The absolute loss is the absolute difference between the desired and predicted outcome. This paper demonstrates worst-case upper bounds on the absolute loss for the Perceptron le...
ICML
1999
IEEE
16 years 13 days ago
1999
IEEE
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...