Time and space efficient large scale link discovery using string similarities

DOI10.3233/FI-2020-1906MaRDI QIDQ5131810zbMATH OpenOpenAlexFDO

Authors Andreas Karampelas, G. A. Vouros

Publication date 9 November 2020

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2020-1906

zbMATH Keywords

edit distancefiltering rulefrequency matchinglink discoverystring matching

Mathematics Subject Classification ID

Internet topics (68M11) Pattern recognition, speech recognition (68T10) Algorithms on strings (68W32)

Recommendations

• A partition-based method for string similarity joins with edit-distance constraints
• Fast schemes for online record linkage
• Linking temporal records
• Pattern mining in linked data by edge-labeling
• Bounded occurrence edit distance: a new metric for string similarity joins with edit distance constraints

Cited in

(1)

• Pattern mining in linked data by edge-labeling

This page was built for publication: Time and space efficient large scale link discovery using string similarities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131810)