Name
Abstract | ||
|---|---|---|
Learning latent structure in complex networks has become an important problem
fueled by many types of networked data originating from practically all fields
of science. In this paper, we propose a new non-parametric Bayesian
multiple-membership latent feature model for networks. Contrary to existing
multiple-membership models that scale quadratically in the number of vertices
the proposed model scales linearly in the number of links admitting
multiple-membership analysis in large scale networks. We demonstrate a
connection between the single membership relational model and multiple
membership models and show on "real" size benchmark network data that
accounting for multiple memberships improves the learning of latent structure
as measured by link prediction while explicitly accounting for multiple
membership result in a more compact representation of the latent structure of
networks. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/MLSP.2011.6064546 | MLSP |
Field | DocType | Volume |
Quadratic growth,Vertex (geometry),Pattern recognition,Computer science,Nonparametric statistics,Feature model,Complex network,Network data,Artificial intelligence,Relational model,Machine learning,Bayesian probability | Journal | abs/1101.5097 |
ISSN | ISBN | Citations |
1551-2541 E-ISBN : 978-1-4577-1622-5 | 978-1-4577-1622-5 | 26 |
PageRank | References | Authors |
1.66 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Morten Mørup | 1 | 704 | 51.29 |
| Mikkel N. Schmidt | 2 | 277 | 26.13 |
| Lars Kai Hansen | 3 | 2776 | 341.03 |