Name
Abstract | ||
|---|---|---|
We present a dynamical model for a population of tests in pattern recognition. Taking a preprocessed initialization of a feature set, we apply a stochastic algorithm based on an efficiency criterion and a Gaussian noise to recursively build and improve the feature space. This algorithm simulates a Markov chain which estimates a probability distribution ${\mathbb P}$ on the set of features. The features are structured as binary trees and we show that such random forests are a good way to represent the evolution of the feature set. We then obtain properties on the dynamic of the features space before applying this algorithm to practical examples such as face detection and microarray analysis. Lastly, we identify the weak limit of our process as a jump-diffusion process defined using the Skorokhod map over simplices. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1137/060656759 | SIAM J. Control and Optimization |
Keywords | Field | DocType |
binary tree,feature space,features space,object recognition,jump-diffusion process,stochastic algorithm,jump diffusion,skorokhod map,feature set,dynamical model,markov chain,gaussian noise,markov processes,pattern recognition,stochastic approximation,feature selection | Feature vector,Mathematical optimization,Markov process,Feature selection,Feature (computer vision),Markov chain,Algorithm,Binary tree,Probability distribution,Initialization,Statistics,Mathematics | Journal |
Volume | Issue | ISSN |
47 | 2 | 0363-0129 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sébastien Gadat | 1 | 50 | 4.37 |