507 search results - page 16 / 102 » Sizes of Ordered Decision Trees |
96
Voted
PR
2010
14 years 11 months ago
2010
The performance of m-out-of-n bagging with and without replacement in terms of the sampling ratio (m/n) is analyzed. Standard bagging uses resampling with replacement to generate ...
110
Voted
ICASSP
2010
IEEE
15 years 19 days ago
2010
IEEE
This paper addresses the training of classification trees for weakly labelled data. We call ”weakly labelled data”, a training set such as the prior labelling information pro...
121
Voted
VLDB
1999
ACM
15 years 4 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
107
click to vote
ICML
2009
IEEE
15 years 7 months ago
2009
IEEE
The label ranking problem consists of learning a model that maps instances to total orders over a finite set of predefined labels. This paper introduces new methods for label ra...
88
Voted
CIKM
2001
Springer
15 years 4 months ago
2001
Springer
Scalable data mining in large databases is one of today's challenges to database technologies. Thus, substantial effort is dedicated to a tight coupling of database and data ...