Re: [Neo4j] Implementing disambiguation algorithms in Neo4j
I was working on a project that used matching algorithms a while back.
What you have is an n-dimensional matching problem. I can't remember
specifically what the last project were using, but this and the linked algos
may be what you're looking for:
http://en.wikipedia.org/wiki/Mahalanobis_distance
On 2 February 2011 07:34, Tim McNamara paperl...@timmcnamara.co.nz wrote:
Say I have two nodes,
{ type: person, name: Neo }
{ type: person, name: Neo }
Over time, I learn their locations. They both live in the same city. This
increases the chances that they're the same person. However, over time it
turns out that their ages differ, therefore it's far less likely that they
are the same Neo.
Is there anything inside of Neo4j that attempts to determine how close two
nodes are? E.g. to what extent their subtrees and properties match?
Additionally, can anyone suggest literature for algorithms for
disambiguating the two entities?
If I wanted to implement something that searches for similarities, that
returns a probability of a match, can I do this within the database or
should I implement it within the application?
--
Tim McNamara
@timClicks
http://timmcnamara.co.nz
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] Reference Implementation for Sugiyama Graph Layout
Thanks Peter, That's a good start for us. Can anyone recommend some mailing lists for visualisation geeks? Just done a 2 hour hunt and turned up nothing :-/ Ben On 14 December 2010 19:41, Peter Neubauer peter.neuba...@neotechnology.com wrote: Hi Ben, I can't recommend any good implementations of the algo, but GraphViz is battle proven, albeit a bit old. Otherwise, no clear preference, have not tested a lot of them :( Anyone else having more experience? Cheers, /peter neubauer GTalk: neubauer.peter Skype peter.neubauer Phone +46 704 106975 LinkedIn http://www.linkedin.com/in/neubauer Twitter http://twitter.com/peterneubauer http://www.neo4j.org - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Tue, Dec 14, 2010 at 8:04 AM, Ben Sand b...@bensand.com wrote: At the front end of our project we're using Prefuse Flare, and wish to display a DAG using the Sugiyama layout, which isn't currently implemented in Flare. The Sugiyama layout algorithm is a way to display a graph hierarchically in a clear fashion that minimises edge crossings without being too costly too compute. Can you recommend a good reference implementation of the Sugiyama layout algorithm? I've found implementations in the following, but I don't know what their quality is like: GraphViz (via Dot) JGraph OpenSymphony Graph# Python UML Tool ModSL GINY References: * Flare: http://flare.prefuse.org/ * Sugiyama: http://kurapov.name/res/file/193.ppt * page 16: http://hci.stanford.edu/courses/cs448b/w09/lectures/20090204-GraphsAndTrees.pdf Cross posting on Stackoverflow: http://stackoverflow.com/questions/4435396/reference-implementation-for-sugiyama-graph-layout Alternatively, is there a mailing list for graph visualization enthusiasts you can recommend? Ben ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
[Neo4j] Reference Implementation for Sugiyama Graph Layout
At the front end of our project we're using Prefuse Flare, and wish to display a DAG using the Sugiyama layout, which isn't currently implemented in Flare. The Sugiyama layout algorithm is a way to display a graph hierarchically in a clear fashion that minimises edge crossings without being too costly too compute. Can you recommend a good reference implementation of the Sugiyama layout algorithm? I've found implementations in the following, but I don't know what their quality is like: GraphViz (via Dot) JGraph OpenSymphony Graph# Python UML Tool ModSL GINY References: * Flare: http://flare.prefuse.org/ * Sugiyama: http://kurapov.name/res/file/193.ppt * page 16: http://hci.stanford.edu/courses/cs448b/w09/lectures/20090204-GraphsAndTrees.pdf Cross posting on Stackoverflow: http://stackoverflow.com/questions/4435396/reference-implementation-for-sugiyama-graph-layout Alternatively, is there a mailing list for graph visualization enthusiasts you can recommend? Ben ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
[Neo4j] Neo4j: Now or Later
Hi, Currently considering neo4j. We know a graph DB is the right solution long term, but we need to get our app out fast and with minimal infrastructure overhead. We won't hit performance issues on SQL for at least 6 months, and we're iterating weekly, so while that may seem close, using unfamiliar tech would slow us down. We're currently work with rails3 on heroku, which is postgres. We have some experience with recursive PostgreSQL queries and none with any NoSQL databases. What's the learning curve like, and how hard is transitioning a SQL array list to neo4j, which we'll need to do if our app is a success? The data structure we want a graph for is a Directed Acyclic Graph). We can implement the basics fairly easily in postgres, but recursive lookups will be a pain to write and costly to run. Thanks, Ben Sand ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
