1996 TheFieldMatchingProblem
- (Monge & Elkan, 1996) ⇒ Alvaro E. Monge, Charles P. Elkan. (1996). “The Field Matching Problem: Algorithms and Applications.” In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD 1996).
Subject Headings: Monge-Elkan Distance Function, Record Deduplication Task.
Notes
- Related to (Cohen, 1998)
- It proposes the use of a Similarity Metric at the Data Record-level to the Record Deduplication Task.
Cited By
Quotes
To combine information from heterogeneous sources, equivalent data in the multiple sources must be identified. This task is the field matching problem. Specifically, the task is to determine whether or not two syntactic values are alternative designations of the same semantic entity. For example the addresses Dept. of Comput. Sci. and Eng., University of California, San Diego, 9500 Gilman Dr. Dept. 0114, La Jolla, CA 92093 and UCSD, Computer Science and Engineering Department, CA 92093-0114 do designate the same department. This paper describes three field matching algorithms, and evaluates their performance on real-world datasets. One proposed method is the well-known Smith-Waterman algorithm for comparing DNA and protein sequences. Several applications of field matching in knowledge discovery are described briefly, including WEBFIND, which is a new software tool that discovers scientific papers published on the worldwide web.
WEBFIND uses external information sources to guide its search for authors and papers. Like many other worldwide web tools, WEBFIND needs to solve the field matching problemn in order to navigate between information sources.
,
| Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
|---|---|---|---|---|---|---|---|---|---|---|
| 1996 TheFieldMatchingProblem | Alvaro E. Monge Charles P. Elkan | The Field Matching Problem: Algorithms and Applications | http://www.aaai.org/Papers/KDD/1996/KDD96-044.pdf |