I have a graph of a bunch of people who are not connected to each other, but instead connected to things they "like". I'd like to start with one person, and find a list of people have the 'most in common' with them.
Ideally I'd like to be able to prioritize the things they like, for example, it is more important to find people who like live in the same town, than people who liked the same movie. One approach is to traverse each 'like', one at a time, in order of importance, and then do a bunch of Set intersections on the results, and then return the list of people in reverse order. Is there a way to do this without having to run a whole bunch of queries? -- Rick Otten [email protected] O=='=+ _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
