Relational Learning and Network Modelling Using Infinite Latent Attribute Models

Latent variable models for network data extract a summary of the relational structure underlying an observed network. The simplest possible models subdivide nodes of the network into clusters; the probability of a link between any two nodes then depends only on their cluster assignment. Currently av...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 37(2015), 2 vom: 01. Feb., Seite 462-74
1. Verfasser: Palla, Konstantina (VerfasserIn)
Weitere Verfasser: Knowles, David A, 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 NLM252591305
003 DE-627
005 20231224164432.0
007 cr uuu---uuuuu
008 231224s2015 xx |||||o 00| ||eng c
024 7 |a 10.1109/TPAMI.2014.2324586  |2 doi 
028 5 2 |a pubmed24n0842.xml 
035 |a (DE-627)NLM252591305 
035 |a (NLM)26353254 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Palla, Konstantina  |e verfasserin  |4 aut 
245 1 0 |a Relational Learning and Network Modelling Using Infinite Latent Attribute Models 
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 27.05.2016 
500 |a Date Revised 10.09.2015 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a Latent variable models for network data extract a summary of the relational structure underlying an observed network. The simplest possible models subdivide nodes of the network into clusters; the probability of a link between any two nodes then depends only on their cluster assignment. Currently available models can be classified by whether clusters are disjoint or are allowed to overlap. These models can explain a "flat" clustering structure. Hierarchical Bayesian models provide a natural approach to capture more complex dependencies. We propose a model in which objects are characterised by a latent feature vector. Each feature is itself partitioned into disjoint groups (subclusters), corresponding to a second layer of hierarchy. In experimental comparisons, the model achieves significantly improved predictive performance on social and biological link prediction tasks. The results indicate that models with a single layer hierarchy over-simplify real networks 
650 4 |a Journal Article 
650 4 |a Research Support, Non-U.S. Gov't 
700 1 |a Knowles, David A  |e verfasserin  |4 aut 
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 462-74  |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:462-74 
856 4 0 |u http://dx.doi.org/10.1109/TPAMI.2014.2324586  |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 462-74