Sciweavers

1131 search results - page 129 / 227
» Generalization Improvement in Multi-Objective Learning
Sort
View
127
Voted
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
16 years 29 days ago
Knowledge transfer via multiple model local structure mapping
The effectiveness of knowledge transfer using classification algorithms depends on the difference between the distribution that generates the training examples and the one from wh...
Jing Gao, Wei Fan, Jing Jiang, Jiawei Han
120
Voted
ICASSP
2010
IEEE
15 years 23 days ago
Semi-Supervised Fisher Linear Discriminant (SFLD)
Supervised learning uses a training set of labeled examples to compute a classifier which is a mapping from feature vectors to class labels. The success of a learning algorithm i...
Seda Remus, Carlo Tomasi
199
Voted
ML
2011
ACM
308views Machine Learning» more  ML 2011»
14 years 7 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
95
Voted
COLT
2005
Springer
15 years 6 months ago
The Value of Agreement, a New Boosting Algorithm
We present a new generalization bound where the use of unlabeled examples results in a better ratio between training-set size and the resulting classifier’s quality and thus red...
Boaz Leskes
AMT
2006
Springer
147views Multimedia» more  AMT 2006»
15 years 4 months ago
Semi-Supervised Text Classification Using Positive and Unlabeled Data
Text classification using positive and unlabeled data refers to the problem of building text classifier using positive documents (P) of one class and unlabeled documents (U) of man...
Shuang Yu, Xueyuan Zhou, Chunping Li