Sciweavers

3694 search results - page 393 / 739
» Stochastic complexity in learning
Sort
View
COLT
2007
Springer
16 years 28 days ago
Mitotic Classes
For the natural notion of splitting classes into two disjoint subclasses via a recursive classifier working on texts, the question is addressed how these splittings can look in th...
Sanjay Jain, Frank Stephan
CIG
2005
IEEE
16 years 11 days ago
A Generic Approach for Generating Interesting Interactive Pac-Man Opponents
This paper follows on from our previous work focused on formulating an efficient generic measure of user’s satisfaction (‘interest’) when playing predator/prey games. Viewin...
Georgios N. Yannakakis, John Hallam
ICDM
2005
IEEE
118views Data Mining» more  ICDM 2005»
16 years 10 days ago
A Heterogeneous Field Matching Method for Record Linkage
Record linkage is the process of determining that two records refer to the same entity. A key subprocess is evaluating how well the individual fields, or attributes, of the recor...
Steven Minton, Claude Nanjo, Craig A. Knoblock, Ma...
KNINVI
2005
Springer
16 years 7 days ago
Digital Concept Maps for Managing Knowledge and Information
Abstract. Due to the increasing amount and complexity of knowledge and information in many domains, students who self-regulate their study in e-learning scenarios often suffer from...
Sigmar-Olaf Tergan
COLT
2000
Springer
15 years 11 months ago
PAC Analogues of Perceptron and Winnow via Boosting the Margin
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
Rocco A. Servedio