Association rules to help populating a never-ending growing knowledge base

Abstract

Large and continuous growing knowledge bases (KBs) have been widely studied in recent years. A major challenge in this field is how to develop techniques to help populating such KBs and improve their coverage. In this context, this work proposes an “association rules”-base approach. We applied an association rule mining algorithm to discover new relations between the instances and categories, to populate a KB. Considering that automatically constructed KBs are often incomplete, we modified traditional support criteria, creating the MSC measure, to deal with missing values. Experiments showed that an association rule mining algorithm, with and without the modified support calculation, brings relevant rules and can play an interesting role in the process of increasing a large growing knowledge base.