Sciweavers

3050 search results - page 378 / 610
» On-line Algorithms in Machine Learning
Sort
View
COLT
2005
Springer
15 years 10 months ago
Variations on U-Shaped Learning
The paper deals with the following problem: is returning to wrong conjectures necessary to achieve full power of algorithmic learning? Returning to wrong conjectures complements t...
Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Fra...
SBIA
2004
Springer
15 years 10 months ago
Learning with Drift Detection
Abstract. Most of the work in machine learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Pedro Medas, Gladys Castillo, Pe...
163
Voted
ICML
2008
IEEE
16 years 6 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
ICML
2004
IEEE
16 years 6 months ago
Text categorization with many redundant features: using aggressive feature selection to make SVMs competitive with C4.5
Text categorization algorithms usually represent documents as bags of words and consequently have to deal with huge numbers of features. Most previous studies found that the major...
Evgeniy Gabrilovich, Shaul Markovitch
WCE
2007
15 years 6 months ago
A Comparison of Classification Techniques for Technical Text Passages
— Our work explores the use of several text categorization techniques for classification of manufacturing quality defect and service shop data sets into fixed categories. Althoug...
Mark M. Kornfein, Helena Goldfarb