1060 search results - page 195 / 212 » On the Discovery of Random Trees |
102
click to vote
KAIS
2008
14 years 10 months ago
2008
Much work on skewed, stochastic, high dimensional, and biased datasets usually implicitly solve each problem separately. Recently, we have been approached by Texas Commission on En...
ALGORITHMICA
1998
14 years 9 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
169
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Researchers in the social and behavioral sciences routinely rely on quasi-experimental designs to discover knowledge from large databases. Quasi-experimental designs (QEDs) exploi...
117
click to vote
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Many feature selection algorithms have been proposed in the past focusing on improving classification accuracy. In this work, we point out the importance of stable feature selecti...