User 1129 | 1/29/2015, 9:54:04 AM
In the past, I have asked about the possibility to split bipartite graphs (http://forum.dato.com/discussion/comment/2277). For example: if a graph connects users who liked certain items, we can split this graph into two: users who liked same items and items who were liked by the same users. For example, igraph, has this function http://igraph.org/python/doc/igraph.Graph-class.html#bipartite_projection that performs just that.
In the previous question, Danny suggested me to use item recommendation, which seems to work fine. However, I have noticed that there is a hard limit on the number of outgoing edges for every node (which is 10). I couldn't find any parameter that will control this.
Is there a way to overcome this limit?