Sciweavers

3050 search results - page 429 / 610
» On-line Algorithms in Machine Learning
Sort
View
CLEF
2010
Springer
15 years 6 months ago
Wiki Vandalysis - Wikipedia Vandalism Analysis - Lab Report for PAN at CLEF 2010
Wikipedia describes itself as the "free encyclopedia that anyone can edit". Along with the helpful volunteers who contribute by improving the articles, a great number of ...
Manoj Harpalani, Thanadit Phumprao, Megha Bassi, M...
ICML
2010
IEEE
15 years 5 months ago
Local Minima Embedding
Dimensionality reduction is a commonly used step in many algorithms for visualization, classification, clustering and modeling. Most dimensionality reduction algorithms find a low...
Minyoung Kim, Fernando De la Torre
ICML
2010
IEEE
15 years 5 months ago
Clustering processes
The problem of clustering is considered, for the case when each data point is a sample generated by a stationary ergodic process. We propose a very natural asymptotic notion of co...
Daniil Ryabko
ML
2002
ACM
141views Machine Learning» more  ML 2002»
15 years 4 months ago
On the Existence of Linear Weak Learners and Applications to Boosting
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
Shie Mannor, Ron Meir
ML
2007
ACM
101views Machine Learning» more  ML 2007»
15 years 4 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre