Sciweavers

851 search results - page 14 / 171
» Random constructions and density results
Sort
View
IDA
2007
Springer
14 years 2 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski
COMBINATORICA
2008
130views more  COMBINATORICA 2008»
13 years 8 months ago
Two-point concentration in random geometric graphs
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
Tobias Müller
IJBC
2008
96views more  IJBC 2008»
13 years 7 months ago
Fractional Processes: from Poisson to Branching One
Fractional generalizations of the Poisson process and branching Furry process are considered. The link between characteristics of the processes, fractional differential equations ...
V. V. Uchaikin, D. O. Cahoy, R. T. Sibatov
AVSS
2007
IEEE
14 years 2 months ago
Vehicular traffic density estimation via statistical methods with automated state learning
This paper proposes a novel approach of combining an unsupervised clustering scheme called AutoClass with Hidden Markov Models (HMMs) to determine the traffic density state in a R...
Evan Tan, Jing Chen
TCS
2008
13 years 8 months ago
Density elimination
Density elimination, a close relative of cut elimination, consists of removing applications of the Takeuti-Titani density rule from derivations in Gentzen-style (hypersequent) cal...
Agata Ciabattoni, George Metcalfe