Re: [Neo4j] most in common

For an example of similar scripts, see http://docs.neo4j.org/chunked/1.4-SNAPSHOT/gremlin-plugin.html#rest-api-send-a-gremlin-script---json-encoded-with-table-result Cheers, /peter neubauer GTalk:      neubauer.peter Skype       peter.neubauer Phone       +46 704 106975 LinkedIn   http://www.lin

Re: [Neo4j] most in common

Hi, Me, being that I know Gremlin (http://gremlin.tinkerpop.com), would do this in Gremlin as such: m = [:] g.v(1).out('like').in('like').except([g.v(1)]).groupCount(m) This is basic collaborative filtering. The statement reads, 1. create the map m 2. starting at vertex with id

Re: [Neo4j] most in common

> I'm guessing you could do something like find the shortest paths? No, I don't think that would work. I'm looking for the "most number of paths through 'like relationships' " rather than the "shortest path". -- Rick Otten rot...@windfish.net O=='=+ _

Re: [Neo4j] most in common

I'm guessing you could do something like find the shortest paths? -- View this message in context: http://neo4j-user-list.438527.n3.nabble.com/Neo4j-most-in-common-tp3099864p3099886.html Sent from the Neo4J User List mailing list archive at Nabbl

[Neo4j] most in common

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 i