An EBMC-based approach to selecting types for entity filtering

4Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

The quantity of entities in the Linked Data is increasing rapidly. For entity search and browsing systems, filtering is very useful for users to find entities that they are interested in. Type is a kind of widely-used facet and can be easily obtained from knowledge bases, which enables to create filters by selecting at most K types of an entity collection. However, existing approaches often fail to select high-quality type filters due to complex overlap between types. In this paper, we propose a novel type selection approach based upon Budgeted Maximum Coverage (BMC), which can achieve integral optimization for the coverage quality of type filters. Furthermore, we define a new optimization problem called Extended Budgeted Maximum Coverage (EBMC) and propose an EBMC-based approach, which enhances the BMC-based approach by incorporating the relevance between entities and types, so as to create sensible type filters. Our experimental results show that the EBMC-based approach performs best comparing with several representative approaches.

Cite

CITATION STYLE

APA

Ding, J., Ding, W., Hu, W., & Qu, Y. (2015). An EBMC-based approach to selecting types for entity filtering. In Proceedings of the National Conference on Artificial Intelligence (Vol. 1, pp. 88–94). AI Access Foundation. https://doi.org/10.1609/aaai.v29i1.9198

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free