Sciweavers

1068 search results - page 67 / 214
» Extremely randomized trees
Sort
View
SADM
2011
13 years 3 months ago
Random survival forests for high-dimensional data
: Minimal depth is a dimensionless order statistic that measures the predictiveness of a variable in a survival tree. It can be used to select variables in high-dimensional problem...
Hemant Ishwaran, Udaya B. Kogalur, Xi Chen, Andy J...
CORR
2008
Springer
167views Education» more  CORR 2008»
13 years 8 months ago
Energy Scaling Laws for Distributed Inference in Random Networks
The energy scaling laws of multihop data fusion networks for distributed inference are considered. The fusion network consists of randomly located sensors independently distributed...
Animashree Anandkumar, Joseph E. Yukich, Lang Tong...
PAA
2002
13 years 8 months ago
Bagging, Boosting and the Random Subspace Method for Linear Classifiers
: Recently bagging, boosting and the random subspace method have become popular combining techniques for improving weak classifiers. These techniques are designed for, and usually ...
Marina Skurichina, Robert P. W. Duin
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
ICIAR
2007
Springer
14 years 19 days ago
Processing Random Amplified Polymorphysm DNA Images Using the Radon Transform and Mathematical Morphology
Abstract. Random Amplified Polymorphism DNA (RAPD) analysis is a wellknown method for studying genetic relationships between individuals. In this context, processing the underlying...
Luis Rueda, Omar Uyarte, Sofia Valenzuela, Jaime R...