Sciweavers

3050 search results - page 457 / 610
» On-line Algorithms in Machine Learning
Sort
View
138
Voted
ICML
2006
IEEE
16 years 5 months ago
How boosting the margin can also boost classifier complexity
Boosting methods are known not to usually overfit training data even as the size of the generated classifiers becomes large. Schapire et al. attempted to explain this phenomenon i...
Lev Reyzin, Robert E. Schapire
151
Voted
ICML
2006
IEEE
16 years 5 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
ICML
2006
IEEE
16 years 5 months ago
Topic modeling: beyond bag-of-words
Some models of textual corpora employ text generation methods involving n-gram statistics, while others use latent topic variables inferred using the "bag-of-words" assu...
Hanna M. Wallach
144
Voted
ICML
2006
IEEE
16 years 5 months ago
Fast time series classification using numerosity reduction
Many algorithms have been proposed for the problem of time series classification. However, it is clear that one-nearest-neighbor with Dynamic Time Warping (DTW) distance is except...
Xiaopeng Xi, Eamonn J. Keogh, Christian R. Shelton...
136
Voted
ICML
2006
IEEE
16 years 5 months ago
Efficient lazy elimination for averaged one-dependence estimators
Semi-naive Bayesian classifiers seek to retain the numerous strengths of naive Bayes while reducing error by weakening the attribute independence assumption. Backwards Sequential ...
Fei Zheng, Geoffrey I. Webb