Swoosh: a generic approach to entity resolution

Cited 135 time in webofscience Cited 0 time in scopus
  • Hit : 77
  • Download : 0
We consider the entity resolution (ER) problem (also known as deduplication, or merge-purge), in which records determined to represent the same real-world entity are successively located and merged. We formalize the generic ER problem, treating the functions for comparing and merging records as black-boxes, which permits expressive and extensible ER solutions. We identify four important properties that, if satisfied by the match and merge functions, enable much more efficient ER algorithms. We develop three efficient ER algorithms: G-Swoosh for the case where the four properties do not hold, and R-Swoosh and F-Swoosh that exploit the four properties. F-Swoosh in addition assumes knowledge of the "features" (e.g., attributes) used by the match function. We experimentally evaluate the algorithms using comparison shopping data from Yahoo! Shopping and hotel information data from Yahoo! Travel. We also show that R-Swoosh (and F-Swoosh) can be used even when the four match and merge properties do not hold, if an "approximate" result is acceptable.
Publisher
SPRINGER
Issue Date
2009-01
Language
English
Article Type
Article
Keywords

RECORD-LINKAGE; INTEGRATION

Citation

VLDB JOURNAL, v.18, no.1, pp.255 - 276

ISSN
1066-8888
DOI
10.1007/s00778-008-0098-x
URI
http://hdl.handle.net/10203/240850
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 135 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0