[ Pagewise preview ]
| Category | Value | ||
| Available via | http://dbpubs.stanford.edu/pub/2006-14 | ||
| Submitted on | 12th of June 2006 | ||
| Author | Benjelloun, Omar; Garcia-Molina, Hector; Kawai, Hideki; Larson, Tait Eliott; Menestrina, David; Su, Qi; Thavisomboon, Sutthipong; Widom, Jennifer | ||
| Title | Generic Entity Resolution in the SERF Project | ||
| Date of publication | June 2006 | ||
| Published in | IEEE Data Engineering Bulletin, June 2006 Issue | ||
| Citation | Benjelloun, Omar; Garcia-Molina, Hector; Kawai, Hideki; Larson, Tait Eliott; Menestrina, David; Su, Qi; Thavisomboon, Sutthipong; Widom, Jennifer. Generic Entity Resolution in the SERF Project, IEEE Data Engineering Bulletin, June 2006 Issue | ||
| Number of pages | 9 | ||
| Language | English | ||
| Project | Miscellaneous | ||
| Type | Other | ||
| Subject group | Data Integration and Mediation | ||
| Abstract | The SERF project at Stanford deals with the Entity Resolution (ER) problem, in which records determined to represent the same real-life ``entities'' (such as people or products) are successively located and combined. The approach we pursue is ``generic'', in the sense that the specific functions used to match and merge records are viewed as black boxes, which permits efficient, expressive and extensible ER solutions. This paper motivates and introduces the principles of generic ER, and gives an overview of the research directions we have been exploring in the SERF project over the past two years. | ||
| Keywords | Data Cleaning, Generic Entity Resolution, Record Linkage, Deduplication | ||
| Fulltext source |
| Management of the document by | siroker@db.stanford.edu
| |
[ Pagewise preview ]