Pitman Yor Diffusion Trees for Bayesian Hierarchical Clustering

In this paper we introduce the Pitman Yor Diffusion Tree (PYDT), a Bayesian non-parametric prior over tree structures which generalises the Dirichlet Diffusion Tree [30] and removes the restriction to binary branching structure. The generative process is described and shown to result in an exchangea...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 37(2015), 2 vom: 01. Feb., Seite 271-89
1. Verfasser: Knowles, David A (VerfasserIn)
Weitere Verfasser: Ghahramani, Zoubin
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2015
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article Research Support, Non-U.S. Gov't
LEADER 01000naa a22002652 4500
001 NLM252591178
003 DE-627
005 20231224164432.0
007 cr uuu---uuuuu
008 231224s2015 xx |||||o 00| ||eng c
024 7 |a 10.1109/TPAMI.2014.2313115  |2 doi 
028 5 2 |a pubmed24n0842.xml 
035 |a (DE-627)NLM252591178 
035 |a (NLM)26353241 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Knowles, David A  |e verfasserin  |4 aut 
245 1 0 |a Pitman Yor Diffusion Trees for Bayesian Hierarchical Clustering 
264 1 |c 2015 
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 24.11.2015 
500 |a Date Revised 10.09.2015 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a In this paper we introduce the Pitman Yor Diffusion Tree (PYDT), a Bayesian non-parametric prior over tree structures which generalises the Dirichlet Diffusion Tree [30] and removes the restriction to binary branching structure. The generative process is described and shown to result in an exchangeable distribution over data points. We prove some theoretical properties of the model including showing its construction as the continuum limit of a nested Chinese restaurant process model. We then present two alternative MCMC samplers which allow us to model uncertainty over tree structures, and a computationally efficient greedy Bayesian EM search algorithm. Both algorithms use message passing on the tree structure. The utility of the model and algorithms is demonstrated on synthetic and real world data, both continuous and binary 
650 4 |a Journal Article 
650 4 |a Research Support, Non-U.S. Gov't 
700 1 |a Ghahramani, Zoubin  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 37(2015), 2 vom: 01. Feb., Seite 271-89  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:37  |g year:2015  |g number:2  |g day:01  |g month:02  |g pages:271-89 
856 4 0 |u http://dx.doi.org/10.1109/TPAMI.2014.2313115  |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 37  |j 2015  |e 2  |b 01  |c 02  |h 271-89