The Community for Technology Leaders
Green Image
We address the issue of classifying complex data. We focus on three main sources of complexity, namely the high dimensionality of the observed data, the dependencies between these observations and the general nature of the noise model underlying their distribution. We investigate the recent {\it Triplet Markov Fields} and propose new models in this class designed for such data and in particular allowing very general noise models. In addition, our models can handle the inclusion of a learning step in a consistent way so that they can be used in a supervised framework. One advantage of our models is that whatever the initial complexity of the noise model, parameter estimation can be carried out using state-of-the-art Bayesian clustering techniques under the usual simplifying assumptions. As generative models, they can be seen as an alternative, in the supervised case, to discriminative Conditional Random Fields. Identifiability issues underlying the models in the non supervised case, are discussed while the models performance is illustrated on simulated and real data exhibiting the mentioned various sources of complexity.
Triplet Markov model, Supervised classification, Conditional independence, Complex noise models, High dimensional data, EM-like algorithms

F. Forbes and J. Blanchet, "Triplet Markov Fields for the Classification of Complex Structure Data," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 30, no. , pp. 1055-1067, 2008.
88 ms
(Ver 3.3 (11022016))