From: Adi E. <ad...@di...> - 2008-12-03 18:16:01
|
Hi All Could someone please point me in the right direction. I've been using Febrl for a little while now and while the entity resolution works well, I'd like to know how to progress from there. According to my algorithm, I know that same(A, B) and same(B, C), I also know that not same(A,C) - clearly, if I made a mistake in my entity resolution. The question is, how do I resolve this issue? I am currently considering some sort of min-cut algorithm that will split my graph in two (i.e. fully connected graph where each person is a node and graph weights are my match score). I'm not clear how well this approach would work and I suspect that I'm not the first person who has come across this problem. Can anyone suggest any reading matter on the topic? Thanks Adi |