Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
289
A Machine Learning Approach to Coreference Resolution of Noun Phrases
, 2001
"... this paper, we present a learning approach to coreference resolution of noun phrases in unrestricted text. The approach learns from a small, annotated corpus and the task includes resolving not just a certain type of noun phrase (e.g., pronouns) but rather general noun phrases. It also does not rest ..."
Abstract
-
Cited by 270 (3 self)
- Add to MetaCart
not restrict the entity types of the noun phrases; that is, coreference is assigned whether they are of "organization," "person," or other types. We evaluate our approach on common data sets (namely, the MUC-6 and MUC-7 coreference corpora) and obtain encouraging results, indicating
Entity Resolution with Markov Logic
- In ICDM
, 2006
"... Entity resolution is the problem of determining which records in a database refer to the same entities, and is a crucial and expensive step in the data mining process. Interest in it has grown rapidly in recent years, and many approaches have been proposed. However, they tend to address only isolate ..."
Abstract
-
Cited by 105 (10 self)
- Add to MetaCart
Entity resolution is the problem of determining which records in a database refer to the same entities, and is a crucial and expensive step in the data mining process. Interest in it has grown rapidly in recent years, and many approaches have been proposed. However, they tend to address only
Comparative evaluation of entity resolution approaches with FEVER
"... We present FEVER, a new evaluation platform for entity resolution approaches. The modular structure of the FEVER framework supports the incorporation or reconstruction of many previously proposed approaches for entity resolution. A distinctive feature of FEVER is that it not only evaluates tradition ..."
Abstract
-
Cited by 15 (4 self)
- Add to MetaCart
traditional measures such as precision and recall but also the effort for configuring (e.g., parameter tuning, training) a good entity resolution approach. FE-VER thus strives for a fair comparative evaluation of different approaches by considering both the effectiveness and configuration effort. 1.
Progressive Approach to Relational Entity Resolution
"... This paper proposes a progressive approach to entity reso-lution (ER) that allows users to explore a trade-off between the resolution cost and the achieved quality of the resolved data. In particular, our approach aims to produce the high-est quality result given a constraint on the resolution bud-g ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
This paper proposes a progressive approach to entity reso-lution (ER) that allows users to explore a trade-off between the resolution cost and the achieved quality of the resolved data. In particular, our approach aims to produce the high-est quality result given a constraint on the resolution bud
Query-Driven Approach to Entity Resolution
"... This paper explores “on-the-fly ” data cleaning in the context of a user query. A novel Query-Driven Approach (QDA) is developed that performs a minimal number of cleaning steps that are only necessary to answer a given selection query correctly. The comprehensive empirical evaluation of the propose ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
This paper explores “on-the-fly ” data cleaning in the context of a user query. A novel Query-Driven Approach (QDA) is developed that performs a minimal number of cleaning steps that are only necessary to answer a given selection query correctly. The comprehensive empirical evaluation
Entity Resolution for Uncertain Data
"... Entity resolution (ER), also known as duplicate detection or record matching, is the prob-lem of identifying the tuples that represent the same real world entity. In this paper, we address the problem of ER for uncertain data, which we call ERUD. We propose two dif-ferent approaches for the ERUD pro ..."
Abstract
- Add to MetaCart
Entity resolution (ER), also known as duplicate detection or record matching, is the prob-lem of identifying the tuples that represent the same real world entity. In this paper, we address the problem of ER for uncertain data, which we call ERUD. We propose two dif-ferent approaches for the ERUD
Contextual Entity Resolution Approach for Genealogical Data
"... Abstract. Due to huge amount of inaccurate information and different types of ambiguity in the available digitized genealogical data, apply-ing Entity Resolution techniques for determining the records referring to the same entity should be considered as the first and still very im-portant step in an ..."
Abstract
- Add to MetaCart
Abstract. Due to huge amount of inaccurate information and different types of ambiguity in the available digitized genealogical data, apply-ing Entity Resolution techniques for determining the records referring to the same entity should be considered as the first and still very im-portant step
Load Balancing for MapReduce-based Entity Resolution
"... Abstract — The effectiveness and scalability of MapReducebased implementations of complex data-intensive tasks depend on an even redistribution of data between map and reduce tasks. In the presence of skewed data, sophisticated redistribution approaches thus become necessary to achieve load balancin ..."
Abstract
-
Cited by 18 (5 self)
- Add to MetaCart
balancing among all reduce tasks to be executed in parallel. For the complex problem of entity resolution, we propose and evaluate two approaches for such skew handling and load balancing. The approaches support blocking techniques to reduce the search space of entity resolution, utilize a preprocessing Map
Efficient Entity Resolution for Large Heterogeneous Information Spaces
"... We have recently witnessed an enormous growth in the volume of structured and semi-structured data sets available on the Web. An important prerequisite for using and combining such data sets is the detection and merge of information that describes the same real-world entities, a task known as Entity ..."
Abstract
-
Cited by 8 (2 self)
- Add to MetaCart
as Entity Resolution. To make this quadratic task efficient, blocking techniques are typically employed. However, the high dynamics, loose schema binding, and heterogeneity of (semi-)structured data, impose new challenges to entity resolution. Existing blocking approaches become inapplicable because
Results 1 - 10
of
289
