The Community for Technology Leaders
2013 IEEE 13th International Conference on Data Mining (2012)
Brussels, Belgium Belgium
Dec. 10, 2012 to Dec. 13, 2012
ISSN: 1550-4786
ISBN: 978-1-4673-4649-8
pp: 948-953
ABSTRACT
We present a method for trust prediction based on no diagonal decompositions of the asymmetric adjacency matrix of a directed network. The method we propose is based on a no diagonal decomposition into directed components (DEDICOM), which we use to learn the coefficients of a matrix polynomial of the network's adjacency matrix. We show that our method can be used to compute better low-rank approximations to a polynomial of a network's adjacency matrix than using the singular value decomposition, and that a higher precision can be achieved at the task of predicting directed links than by undirected or bipartite methods.
INDEX TERMS
decomposition into directed components, trust
CITATION
Jerome Kunegis, Jorg Fliege, "Predicting Directed Links Using Nondiagonal Matrix Decompositions", 2013 IEEE 13th International Conference on Data Mining, vol. 00, no. , pp. 948-953, 2012, doi:10.1109/ICDM.2012.16
90 ms
(Ver 3.3 (11022016))