2009
DOI: 10.1007/978-1-4419-0176-7_4
|View full text |Cite
|
Sign up to set email alerts
|

Semantic Data Matching: Principles and Performance

Abstract: Automated and real-time management of customer relationships requires robust and intelligent data matching across widespread and diverse data sources. Simple string matching algorithms, such as dynamic programming, can handle typographical errors in the data, but are less able to match records that require contextual and experiential knowledge. Latent Semantic Indexing (LSI) (Berry et al. 1995;Deerwester et al. 1990) is a machine intelligence technique that can match data based upon higher order structure, and… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2014
2014

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 5 publications
(2 reference statements)
0
2
0
Order By: Relevance
“…In this approach we will be using three techniques. They are: 1) PNRS (Near Miss Strategy) 2) Transitive Closure 3) Semantic Approach based on Learning Systems Here we will be using Semantic Data Cleaning algorithm [6] along with modified versions of PNRS and Transitive Closure. The Semantic Approach will be using the learning system to clean the data.…”
Section: Figure 2 Flowchart Of Hadclean [Source 9]mentioning
confidence: 99%
“…In this approach we will be using three techniques. They are: 1) PNRS (Near Miss Strategy) 2) Transitive Closure 3) Semantic Approach based on Learning Systems Here we will be using Semantic Data Cleaning algorithm [6] along with modified versions of PNRS and Transitive Closure. The Semantic Approach will be using the learning system to clean the data.…”
Section: Figure 2 Flowchart Of Hadclean [Source 9]mentioning
confidence: 99%
“…Semantic Data Matching Principles [11] can be applied to the data along with the above to get better results. The work in [5] clearly explains how this problem can be avoided by keeping a unique consistent name for the city based on the semantic similarity between the attribute values e.g.…”
Section: Transitive Closurementioning
confidence: 99%