18 search results - page 2 / 4 » Empirical Study of the Universum SVM Learning for High-Dimen... |
MMM
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
IJCNLP
2004
Springer
14 years 25 days ago
2004
Springer
We present a study of new word identification (NWI) to improve the performance of a Chinese word segmenter. In this paper the distribution and types of new words are discussed emp...
ECAI
2004
Springer
14 years 26 days ago
2004
Springer
Advances in data collection technologies allow accumulation of large and high dimensional datasets and provide opportunities for learning high quality classification and regression...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Despite popular belief, boosting algorithms and related coordinate descent methods are prone to overfitting. We derive modifications to AdaBoost and related gradient-based coordin...
BMCBI
2007
13 years 7 months ago
2007
Background: Classification studies using gene expression datasets are usually based on small numbers of samples and tens of thousands of genes. The selection of those genes that a...