Welcome to the InfoSci Platform
Reference Hub2
Knowledge Base Refinement Using Limited Amount of Efforts from Experts

Knowledge Base Refinement Using Limited Amount of Efforts from Experts

Ki Chan, Wai Lam, Tak-Lam Wong
Copyright: © 2014 |Volume: 4 |Issue: 2 |Pages: 19
ISSN: 2155-6393|EISSN: 2155-6407|EISBN13: 9781466655348|DOI: 10.4018/ijkbo.2014040101
Cite Article Cite Article

MLA

Chan, Ki, et al. "Knowledge Base Refinement Using Limited Amount of Efforts from Experts." IJKBO vol.4, no.2 2014: pp.1-19. http://doi.org/10.4018/ijkbo.2014040101

APA

Chan, K., Lam, W., & Wong, T. (2014). Knowledge Base Refinement Using Limited Amount of Efforts from Experts. International Journal of Knowledge-Based Organizations (IJKBO), 4(2), 1-19. http://doi.org/10.4018/ijkbo.2014040101

Chicago

Chan, Ki, Wai Lam, and Tak-Lam Wong. "Knowledge Base Refinement Using Limited Amount of Efforts from Experts," International Journal of Knowledge-Based Organizations (IJKBO) 4, no.2: 1-19. http://doi.org/10.4018/ijkbo.2014040101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Knowledge bases are essential for supporting decision making during intelligent information processing. Automatic construction of knowledge bases becomes infeasible without labeled data, a complete table of data records including answers to queries. Preparing such information requires huge efforts from experts. The authors propose a new knowledge base refinement framework based on pattern mining and active learning using an existing available knowledge base constructed from a different domain (source domain) solving the same task as well as some data collected from the target domain. The knowledge base investigated in this paper is represented by a model known as Markov Logic Networks. The authors' proposed method first analyzes the unlabeled target domain data and actively asks the expert to provide labels (or answers) a very small amount of automatically selected queries. The idea is to identify the target domain queries whose underlying relations are not sufficiently described by the existing source domain knowledge base. Potential relational patterns are discovered and new logic relations are constructed for the target domain by exploiting the limited amount of labeled target domain data and the unlabeled target domain data. The authors have conducted extensive experiments by applying our approach to two different text mining applications, namely, pronoun resolution and segmentation of citation records, demonstrating consistent improvements.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.