> > Limit meaning in this run? Or at all times? The first is ok, the > second not. I guess you mean exiting after I have computed already 10 > new relationships right? >
Well, actually I was aiming for an algorithm that would converge on a stable state. This means, if no new information is being added to the graph, with enough runs of randomly adding relationships and trimming low weighted ones, the graph would stabilize with a fixed set of reasonably high weighted relationships. This would provide fast answers to your queries. If you always add 10 new ones, the convergence would be to a complete graph with everyone related to everyone, which would hit query performance badly (and make for a very, very big graph containing mostly low value information). Then as new information is added (new users added), the graph automatically adjusts to a new stable state (now including relationships of high value to those new users). This might be interesting to keep the density low but I have to look > at it since they way it works is that people see suggestions of other > users that have a good match. I can't probably make them disappear > suddenly. > The trimmer should only remove low value relationships. These are relationships that have been scored as not being a good match, so the user should not see anything disappear, since they would presumably be looking at good matches. In principle I guess a user could look through all their matches, and it is possible they might see low scoring ones which are then trimmed away. I do not see a problem with this, based on my limited understanding of what you are after. Cheers, Craig _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
