Sciweavers

1435 search results - page 32 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
ICML
2006
IEEE
14 years 9 months ago
Estimating relatedness via data compression
We show that it is possible to use data compression on independently obtained hypotheses from various tasks to algorithmically provide guarantees that the tasks are sufficiently r...
Brendan Juba
NIPS
1998
13 years 9 months ago
Semi-Supervised Support Vector Machines
We introduce a semi-supervised support vector machine (S3 VM) method. Given a training set of labeled data and a working set of unlabeled data, S3 VM constructs a support vector m...
Kristin P. Bennett, Ayhan Demiriz
KDD
2002
ACM
125views Data Mining» more  KDD 2002»
14 years 9 months ago
Pattern discovery in sequences under a Markov assumption
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...
Darya Chudova, Padhraic Smyth
JCIT
2008
94views more  JCIT 2008»
13 years 8 months ago
Finding Semantic Errors in the Rule-base of Production Systems, and Reasoning with Insufficient Input Data Petri-net-based Appro
Two simple but practical production systems are modeled using Petri Nets. Petri-net models are very useful in finding semantic errors like generalization error and missing conditi...
Hong-Youl Lee
TSP
2008
105views more  TSP 2008»
13 years 8 months ago
A Fresh Look at the Bayesian Bounds of the Weiss-Weinstein Family
Minimal bounds on the mean square error (MSE) are generally used in order to predict the best achievable performance of an estimator for a given observation model. In this paper, w...
Alexandre Renaux, Philippe Forster, Pascal Larzaba...