Learning Knowledge Using Frequent Subgraph Mining from Ontology Graph Data

• Main Authors: Kwangyon Lee, Haemin Jung, June Seok Hong, Wooju Kim
• Format: Article
• Language: English
• Published: MDPI AG 2021-01-01
• Series: Applied Sciences
• Subjects: frequent subgraph mining; knowledge graph; semantic web; ontology; rating prediction; recommendation
• Online Access: https://www.mdpi.com/2076-3417/11/3/932

In many areas, vast amounts of information are rapidly accumulating in the form of ontology-based knowledge graphs, and the use of information in these forms of knowledge graphs is becoming increasingly important. This study proposes a novel method for efficiently learning frequent subgraphs (i.e., knowledge) from ontology-based graph data. An ontology-based large-scale graph is decomposed into small unit subgraphs, which are used as the unit to calculate the frequency of the subgraph. The frequent subgraphs are extracted through candidate generation and chunking processes. To verify the usefulness of the extracted frequent subgraphs, the methodology was applied to movie rating prediction. Using the frequent subgraphs as user profiles, the graph similarity between the rating graph and new item graph was calculated to predict the rating. The MovieLens dataset was used for the experiment, and a comparison showed that the proposed method outperformed other widely used recommendation methods. This study is meaningful in that it proposed an efficient method for extracting frequent subgraphs while maintaining semantic information and considering scalability in large-scale graphs. Furthermore, the proposed method can provide results that include semantic information to serve as a logical basis for rating prediction or recommendation, which existing methods are unable to provide.