Offline Strategies for Online Set Expansion Open Access

[摘要] Set expansion aims at expanding a given query seed set into a larger and more complete set by adding elements that are likely to belong to the same grouping as the elements of the query set. This thesis studies the problem of efficient set expansion; in particular, given a collection of data sets, each corresponding to an object grouping, and a query set, we develop offline strategies to preprocess and organize the data sets such that online set expansion queries can be answered efficiently. We show how those strategies can be tuned for different set expansion semantics. We also evaluate our algorithms on a real dataset, constructed from the Wikipedia tables.

[发布机构] University of Alberta

[效力级别] index