Proceedings of the 24th International Conference on World Wide Web 2015
DOI: 10.1145/2736277.2741644
|View full text |Cite
|
Sign up to set email alerts
|

Concept Expansion Using Web Tables

Abstract: We study the following problem: given the name of an ad-hoc concept as well as a few seed entities belonging to the concept, output all entities belonging to it. Since producing the exact set of entities is hard, we focus on returning a ranked list of entities. Previous approaches either use seed entities as the only input, or inherently require negative examples. They suffer from input ambiguity and semantic drift, or are not viable options for ad-hoc tail concepts. In this paper, we propose to leverage the m… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
39
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 46 publications
(39 citation statements)
references
References 29 publications
0
39
0
Order By: Relevance
“…It is closely related to the task of entity set expansion [2,5,7], which is about expanding a seed entity set with additional instances. The main difference between row population and entity entity set expansion is that we can also leverage additional data from the seed table as input, not only the core column entities.…”
Section: Row Populationmentioning
confidence: 99%
“…It is closely related to the task of entity set expansion [2,5,7], which is about expanding a seed entity set with additional instances. The main difference between row population and entity entity set expansion is that we can also leverage additional data from the seed table as input, not only the core column entities.…”
Section: Row Populationmentioning
confidence: 99%
“…He and Xin [10] focus on entity list data, by picking the top-k entities based on relevance between the candidate entity and seed entities, and then iteratively ranking them according to a combination of relevance and coherence. Similar iterative steps are conducted in [26,29]. Wang and Cohen [29] use a random walk method for ranking during iterations.…”
Section: Related Workmentioning
confidence: 99%
“…One line of prior work [4,16] relies on a knowledge base for establishing this semantic similarity. Another family of approaches [8,26,29] leverages a large table corpus for collecting co-occurrence statistics. We combine both these sources in a single model:…”
Section: Entity Similaritymentioning
confidence: 99%
See 1 more Smart Citation
“…While this approach can achieve relatively good quality, the required seed-oriented online data extraction is costly. Therefore, more studies [17] [23][10] [28] [21] are proposed in a corpus-based setting where sets are expanded by offline processing based on a specific corpus. For corpus-based set expansion, there are two general approaches, one-time entity ranking and iterative pattern-based bootstrapping.…”
Section: Introductionmentioning
confidence: 99%