Triplet markov fields for the classification of complex structure data

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 Triplet...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 30(2008), 6 vom: 20. Juni, Seite 1055-67
1. Verfasser: Blanchet, Juliette (VerfasserIn)
Weitere Verfasser: Forbes, Florence
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2008
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM179010611
003 DE-627
005 20231223153046.0
007 cr uuu---uuuuu
008 231223s2008 xx |||||o 00| ||eng c
024 7 |a 10.1109/TPAMI.2008.27  |2 doi 
028 5 2 |a pubmed24n0597.xml 
035 |a (DE-627)NLM179010611 
035 |a (NLM)18421110 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Blanchet, Juliette  |e verfasserin  |4 aut 
245 1 0 |a Triplet markov fields for the classification of complex structure data 
264 1 |c 2008 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 27.06.2008 
500 |a Date Revised 18.04.2008 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a 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 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 
650 4 |a Journal Article 
700 1 |a Forbes, Florence  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 30(2008), 6 vom: 20. Juni, Seite 1055-67  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:30  |g year:2008  |g number:6  |g day:20  |g month:06  |g pages:1055-67 
856 4 0 |u http://dx.doi.org/10.1109/TPAMI.2008.27  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 30  |j 2008  |e 6  |b 20  |c 06  |h 1055-67