Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Gao, Huana; b; * | Qi, Guilina; b | Ji, Qiuc
Affiliations: [a] School of Computer Science and Engineering, Southeast University, Nanjing, Jiangsu, China | [b] Key Laboratory of Computer Network and Information Integration (Southeast University), Ministry of Education, Nanjing, Jiangsu, China | [c] School of Modern Posts and Institute of Modern Posts, Nanjing University of Posts and Telecommunications, Nanjing, Jiangsu, China
Correspondence: [*] Corresponding author: Huan Gao, School of Computer Science and Engineering, Southeast University, Nanjing, Jiangsu, China. E-mail: gh@seu.edu.cn.
Abstract: With the development of the Semantic Web, more and more semantic data including many useful knowledge bases has been published on the Web. Such knowledge bases always lack expressive schema information, especially disjointness axioms and subclass axioms. This makes it difficult to perform many critical Semantic Web tasks like ontology reasoning, inconsistency handling and ontology mapping. To deal with this problem, a few approaches have been proposed to generate terminology axioms. However, they often adopt the closed world assumption which is opposite to the assumption adopted by the semantic data. This may lead to a lot of noisy negative examples so that existing learning approaches fail to perform well on such incomplete data. In this paper, a novel framework is proposed to automatically obtain disjointness axioms and subclass axioms from incomplete semantic data. This framework first obtains probabilistic type assertions by exploiting a type inference algorithm. Then a mining approach based on association rule mining is proposed to learn high-quality schema information. To address the incompleteness problem of semantic data, the mining model introduces novel definitions to compute the support and confidence for pruning false axioms. Our experimental evaluation shows promising results over several real-life incomplete knowledge bases like DBpedia and LUBM by comparing with existing relevant approaches.
Keywords: Ontology learning, knowledge bases, open world assumption, association rule mining, semantic web
DOI: 10.3233/IDA-173514
Journal: Intelligent Data Analysis, vol. 22, no. 6, pp. 1337-1353, 2018
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl