Sciweavers

919 search results - page 69 / 184
» Generalizing over Several Learning Settings
Sort
View
KDD
2001
ACM
216views Data Mining» more  KDD 2001»
14 years 8 months ago
The distributed boosting algorithm
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
Aleksandar Lazarevic, Zoran Obradovic
DIS
2009
Springer
14 years 2 months ago
MICCLLR: Multiple-Instance Learning Using Class Conditional Log Likelihood Ratio
Multiple-instance learning (MIL) is a generalization of the supervised learning problem where each training observation is a labeled bag of unlabeled instances. Several supervised ...
Yasser El-Manzalawy, Vasant Honavar
ECML
2004
Springer
14 years 1 months ago
Improving Random Forests
Random forests are one of the most successful ensemble methods which exhibits performance on the level of boosting and support vector machines. The method is fast, robust to noise,...
Marko Robnik-Sikonja
BPM
2010
Springer
186views Business» more  BPM 2010»
13 years 9 months ago
How to Implement a Theory of Correctness in the Area of Business Processes and Services
During the previous years, we presented several results concerned with various issues related to the correctness of models for business processes and services (i. e., interorganiza...
Niels Lohmann, Karsten Wolf
COGSCI
2007
87views more  COGSCI 2007»
13 years 7 months ago
Explaining Color Term Typology With an Evolutionary Model
An expression-induction model was used to simulate the evolution of basic color terms to test Berlin and Kay’s (1969) hypothesis that the typological patterns observed in basic ...
Mike Dowman