Sciweavers

656 search results - page 53 / 132
» Large-Graph Layout Algorithms at Work: An Experimental Study
Sort
View
76
Voted
NIPS
2007
14 years 11 months ago
A Game-Theoretic Approach to Apprenticeship Learning
We study the problem of an apprentice learning to behave in an environment with an unknown reward function by observing the behavior of an expert. We follow on the work of Abbeel ...
Umar Syed, Robert E. Schapire
KAIS
2006
126views more  KAIS 2006»
14 years 9 months ago
Fast and exact out-of-core and distributed k-means clustering
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
Ruoming Jin, Anjan Goswami, Gagan Agrawal
80
Voted
CIKM
2008
Springer
14 years 11 months ago
Semi-supervised text categorization by active search
In automated text categorization, given a small number of labeled documents, it is very challenging, if not impossible, to build a reliable classifier that is able to achieve high...
Zenglin Xu, Rong Jin, Kaizhu Huang, Michael R. Lyu...
ECML
2007
Springer
15 years 3 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
IJHPCA
2006
99views more  IJHPCA 2006»
14 years 9 months ago
A Pragmatic Analysis Of Scheduling Environments On New Computing Platforms
Today, large scale parallel systems are available at relatively low cost. Many powerful such systems have been installed all over the world and the number of users is always incre...
Lionel Eyraud