Sciweavers

341 search results - page 18 / 69
» Learning to satisfy
Sort
View
ICML
2008
IEEE
14 years 8 months ago
Memory bounded inference in topic models
What type of algorithms and statistical techniques support learning from very large datasets over long stretches of time? We address this question through a memory bounded version...
Ryan Gomes, Max Welling, Pietro Perona
ALT
2009
Springer
14 years 4 months ago
Agnostic Clustering
Motivated by the principle of agnostic learning, we present an extension of the model introduced by Balcan, Blum, and Gupta [3] on computing low-error clusterings. The extended mod...
Maria-Florina Balcan, Heiko Röglin, Shang-Hua...
ICALT
2008
IEEE
14 years 1 months ago
A Framework for Semantic Group Formation
Collaboration has long been considered an effective approach to learning. However, forming optimal groups can be a time consuming and complex task. Different approaches have been ...
Asma Ounnas, Hugh C. Davis, David E. Millard
COLT
2007
Springer
14 years 1 months ago
Occam's Hammer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
Gilles Blanchard, François Fleuret
ICALT
2007
IEEE
13 years 9 months ago
An Evaluation of Automatic Text Categorization in Online Discussion Analysis
Content analysis is often employed by teachers and research to analyse online discussion forums to serve various purposes such as assessment, evaluation, and educational research....
Andrew Kwok-Fai Lui, Siu Cheung Li, Sheung-On Choy