Learn More
A monotone drawing of a graph G is a straight-line drawing of G such that, for every pair of vertices u, w in G, there exists a path P uw in G that is monotone in some direction l uw. (Namely, the order of the orthogonal projections of the vertices of P uw on l uw is the same as the order they appear in P uw .) The problem of finding monotone drawings for(More)
In this paper, we propose a novel collaborative filtering approach for predicting the unobserved links in a network (or graph) with both topological and node features. Our approach improves the well-known compressed sensing based matrix completion method by introducing a new multiple-independent-Bernoulli-distribution model as the data sampling mask. It(More)
  • 1