Sciweavers

573 search results - page 47 / 115
» Probabilistic Explanation Based Learning
Sort
View
JMLR
2006
90views more  JMLR 2006»
13 years 8 months ago
Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition
We present worst case bounds for the learning rate of a known prediction method that is based on hierarchical applications of binary context tree weighting (CTW) predictors. A heu...
Ron Begleiter, Ran El-Yaniv
TKDE
2008
123views more  TKDE 2008»
13 years 8 months ago
Explaining Classifications For Individual Instances
We present a method for explaining predictions for individual instances. The presented approach is general and can be used with all classification models that output probabilities...
Marko Robnik-Sikonja, Igor Kononenko
CTW
2002
74views more  CTW 2002»
13 years 8 months ago
Nine Steps to Move Forward from Error
: Following celebrated failures stakeholders begin to ask questions about how to improve the systems and processes they operate, manage or depend on. In this process it is easy to ...
David D. Woods, Richard I. Cook
JMLR
2010
104views more  JMLR 2010»
13 years 3 months ago
How to Explain Individual Classification Decisions
After building a classifier with modern tools of machine learning we typically have a black box at hand that is able to predict well for unseen data. Thus, we get an answer to the...
David Baehrens, Timon Schroeter, Stefan Harmeling,...
ICGI
1994
Springer
14 years 23 days ago
Computer Assisted Grammar Construction
: This paper proposes a new inference approach for Chinese probabilistic context-free grammar, which implements the EM algorithm based on the bracket matching schemes. By utilizing...
S. J. Young, H.-H. Shih