2012
DOI: 10.1007/978-3-642-32115-3_20
|View full text |Cite
|
Sign up to set email alerts
|

Named Entity Matching in Publication Databases

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 9 publications
0
4
0
Order By: Relevance
“…It is actually not possible to go back and forth along the document queue to check if something similar is already loaded, especially given the potentially high cost of comparisons between structured data entities. Thus, data cleansing, deduplication and regularization (further called matching [12]) are done within RDBMS.…”
Section: Matching With Big Datamentioning
confidence: 99%
See 3 more Smart Citations
“…It is actually not possible to go back and forth along the document queue to check if something similar is already loaded, especially given the potentially high cost of comparisons between structured data entities. Thus, data cleansing, deduplication and regularization (further called matching [12]) are done within RDBMS.…”
Section: Matching With Big Datamentioning
confidence: 99%
“…All algorithms that we examined in order to group instances into clusters corresponding to objects generally comprise of the following stages [5], [12]: 1) Heuristically pre-partition the set of instances onto buckets of cases which may potentially support the same objects, using some instance properties and attributes. (In some implementations, we let buckets slightly overlap with each other.)…”
Section: Matching With Big Datamentioning
confidence: 99%
See 2 more Smart Citations