1 Hit in 10.7 sec

Temporal Graph Record Linkage and k-Safe Approximate Match [article]

(:Unkn) Unknown, University, My, Justin Y. Shi
PSH – The Probabilistic Signature Hash is a composite method that increases the speed of Damerau-Levenshtein edit-distance. It combines si [...]  ...  However, due to high computational complexity, edit-distance will not scale well with big data problems. We developed two methodologies for resolving the aforementioned issues: PSH and ALIM.  ...  The RecFN edge connects each Record with its corresponding Data. This structure  ... 
doi:10.34944/dspace/3061 fatcat:eevkjx7iybcjjeqjndmt3zuyyq