Sciweavers

1291 search results - page 149 / 259
» Learning Rules from Distributed Data
Sort
View
110
Voted
ADBIS
1999
Springer
104views Database» more  ADBIS 1999»
15 years 7 months ago
Arbiter Meta-Learning with Dynamic Selection of Classifiers and Its Experimental Investigation
In data mining, the selection of an appropriate classifier to estimate the value of an unknown attribute for a new instance has an essential impact to the quality of the classifica...
Alexey Tsymbal, Seppo Puuronen, Vagan Y. Terziyan
103
Voted
NIPS
2003
15 years 4 months ago
Learning the k in k-means
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
Greg Hamerly, Charles Elkan
136
Voted
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
15 years 4 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
124
Voted
PAMI
2008
302views more  PAMI 2008»
15 years 2 months ago
Learning to Detect Moving Shadows in Dynamic Environments
We propose a novel adaptive technique for detecting moving shadows and distinguishing them from moving objects in video sequences. Most methods for detecting shadows work in a stat...
Ajay J. Joshi, Nikolaos Papanikolopoulos
137
Voted
NIPS
2001
15 years 4 months ago
On the Generalization Ability of On-Line Learning Algorithms
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...