Sciweavers

1277 search results - page 165 / 256
» Terminating Decision Algorithms Optimally
Sort
View
159
Voted
MCS
2005
Springer
15 years 9 months ago
Ensemble Confidence Estimates Posterior Probability
We have previously introduced the Learn++ algorithm that provides surprisingly promising performance for incremental learning as well as data fusion applications. In this contribut...
Michael Muhlbaier, Apostolos Topalis, Robi Polikar
105
Voted
SWAT
1992
Springer
116views Algorithms» more  SWAT 1992»
15 years 7 months ago
Sorting Multisets Stably in Minimum Space
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
Jyrki Katajainen, Tomi Pasanen
125
Voted
NIPS
2007
15 years 5 months ago
Regularized Boost for Semi-Supervised Learning
Semi-supervised inductive learning concerns how to learn a decision rule from a data set containing both labeled and unlabeled data. Several boosting algorithms have been extended...
Ke Chen 0001, Shihai Wang
149
Voted
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
14 years 10 months ago
Multistage K-Means Clustering for Scenario Tree Construction
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
Kristina Sutiene, Dalius Makackas, Henrikas Pranev...
DSS
2007
122views more  DSS 2007»
15 years 3 months ago
A stochastic beam search for the berth allocation problem
Abstract. In this paper, the optimization of the Berth Allocation Problem (BAP) is transformed into a multiple stage decision making procedure and a new stochastic beam search algo...
Fan Wang, Andrew Lim