Sciweavers

1435 search results - page 7 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
JMLR
2008
111views more  JMLR 2008»
13 years 7 months ago
Ranking Categorical Features Using Generalization Properties
Feature ranking is a fundamental machine learning task with various applications, including feature selection and decision tree learning. We describe and analyze a new feature ran...
Sivan Sabato, Shai Shalev-Shwartz
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 7 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
ICML
2007
IEEE
14 years 8 months ago
Asymptotic Bayesian generalization error when training and test distributions are different
In supervised learning, we commonly assume that training and test data are sampled from the same distribution. However, this assumption can be violated in practice and then standa...
Keisuke Yamazaki, Klaus-Robert Müller, Masash...
ICDM
2010
IEEE
178views Data Mining» more  ICDM 2010»
13 years 5 months ago
Exploiting Unlabeled Data to Enhance Ensemble Diversity
Ensemble learning aims to improve generalization ability by using multiple base learners. It is well-known that to construct a good ensemble, the base learners should be accurate a...
Min-Ling Zhang, Zhi-Hua Zhou
COLING
2008
13 years 8 months ago
On Robustness and Domain Adaptation using SVD for Word Sense Disambiguation
In this paper we explore robustness and domain adaptation issues for Word Sense Disambiguation (WSD) using Singular Value Decomposition (SVD) and unlabeled data. We focus on the s...
Eneko Agirre, Oier Lopez de Lacalle