3949 search results - page 355 / 790 » Machine Learning and Data Mining |
141
click to vote
ALT
2008
Springer
16 years 1 months ago
2008
Springer
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
150
click to vote
MLDM
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we propose a new criterion, based on Minimum Description Length (MDL), to estimate an optimal number of clusters. This criterion, called Kernel MDL (KMDL), is particu...
159
click to vote
ML
2006
ACM
15 years 4 months ago
2006
ACM
We present an approach to email filtering based on the suffix tree data structure. A method for the scoring of emails using the suffix tree is developed and a number of scoring and...
156
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The aim of this study is to show the importance of two classification techniques, viz. decision tree and clustering, in prediction of learning disabilities (LD) of school-age chil...
139
click to vote
ICDM
2010
IEEE
15 years 2 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...