Sciweavers

2208 search results - page 152 / 442
» Privacy-Preserving Classifier Learning
Sort
View
117
Voted
ICML
2010
IEEE
15 years 4 months ago
Risk minimization, probability elicitation, and cost-sensitive SVMs
A new procedure for learning cost-sensitive SVM classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the cost-sensitive SVM is derived as the...
Hamed Masnadi-Shirazi, Nuno Vasconcelos
SDM
2012
SIAM
216views Data Mining» more  SDM 2012»
13 years 6 months ago
Feature Selection "Tomography" - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable
:  Feature Selection “Tomography” - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable George Forman HP Laboratories HPL-2010-19R1 Feature selection; ...
George Forman
126
Voted
ICPR
2006
IEEE
16 years 4 months ago
A maximum margin discriminative learning algorithm for temporal signals
We propose a new maximum margin discriminative learning algorithm here for classification of temporal signals. It is superior to conventional HMM in the sense that it does not nee...
Wenjie Xu, Jiankang Wu, Zhiyong Huang
ICALT
2008
IEEE
15 years 10 months ago
Designing a Dynamic Bayesian Network for Modeling Students' Learning Styles
When using Learning Object Repositories, it is interesting to have mechanisms to select the more adequate objects for each student. For this kind of adaptation, it is important to...
Cristina Carmona, Gladys Castillo, Eva Millá...
120
Voted
CIKM
2008
Springer
15 years 5 months ago
Group-based learning: a boosting approach
This paper points out that many machine learning problems in IR should be and can be formalized in a novel way, referred to as `group-based learning'. In group-based learning...
Weijian Ni, Jun Xu, Hang Li, Yalou Huang