𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Margin optimization based pruning for random forest

✍ Scribed by Fan Yang; Wei-hang Lu; Lin-kai Luo; Tao Li

Book ID
116764420
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
619 KB
Volume
94
Category
Article
ISSN
0925-2312

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimal Randomized EREW PRAM Algorithms
Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests
✍ Shay Halperin; Uri Zwick πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 384 KB

We present the first randomized O log n time and O m + n work EREW PRAM algorithm for finding a spanning forest of an undirected graph G = V E with n vertices and m edges. Our algorithm is optimal with respect to time, work, and space. As a consequence we get optimal randomized EREW PRAM algorithms

Bounds for optimal stopping values of de
Bounds for optimal stopping values of dependent random variables with given marginals
✍ Alfred MΓΌller πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 92 KB

We consider the problem of optimal stopping of a ÿnite sequence of dependent random variables. We explicitly determine the maximum of the stopping value within the Frà echet class of all multivariate distributions with given continuous marginals. We show that the maximum is attained for a shu e of m