5592 search results - page 205 / 1119 » On Random Betweenness Constraints |
160
click to vote
CIKM
2005
Springer
15 years 11 months ago
2005
Springer
It has long been recognized that capturing term relationships is an important aspect of information retrieval. Even with large amounts of data, we usually only have significant ev...
162
click to vote
CP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
185
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
209
Voted
ESANN
2006
15 years 7 months ago
2006
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
172
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Random forests (RF) have been increasingly used in applications such as genome-wide association and microarray studies where predictor correlation is frequently observ...