Sciweavers

3050 search results - page 408 / 610
» On-line Algorithms in Machine Learning
Sort
View
ECML
2007
Springer
15 years 11 months ago
Avoiding Boosting Overfitting by Removing Confusing Samples
Boosting methods are known to exhibit noticeable overfitting on some datasets, while being immune to overfitting on other ones. In this paper we show that standard boosting algorit...
Alexander Vezhnevets, Olga Barinova
140
Voted
CIKM
2005
Springer
15 years 10 months ago
A novel refinement approach for text categorization
In this paper we present a novel strategy, DragPushing, for improving the performance of text classifiers. The strategy is generic and takes advantage of training errors to succes...
Songbo Tan, Xueqi Cheng, Moustafa Ghanem, Bin Wang...
133
Voted
IUI
2003
ACM
15 years 10 months ago
Adapting to the user's internet search strategy on small devices
World Wide Web search engines typically return thousands of results to the users. To avoid users browsing through the whole list of results, search engines use ranking algorithms ...
Jean-David Ruvini
ECML
2006
Springer
15 years 8 months ago
Prioritizing Point-Based POMDP Solvers
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods such as PBVI, Perseus, and HSVI, which quickly converge to an approximate so...
Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony
ECML
2006
Springer
15 years 8 months ago
An Adaptive Kernel Method for Semi-supervised Clustering
Semi-supervised clustering uses the limited background knowledge to aid unsupervised clustering algorithms. Recently, a kernel method for semi-supervised clustering has been introd...
Bojun Yan, Carlotta Domeniconi