Tim, I don't know enough about disambiguation algos to point you in any special direction, but implementation-wise you could hook into the event framework, http://wiki.neo4j.org/content/Event_framework, in order to do e.g. graph matching queries upon any modifying transaction changing database content.
HTH 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, Feb 1, 2011 at 9:34 PM, 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
