Learning Knowledge Using Frequent Subgraph Mining from Ontology Graph Data
Open Access
- 20 January 2021
- journal article
- research article
- Published by MDPI AG in Applied Sciences
- Vol. 11 (3) , 932
Abstract
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.Keywords
This publication has 17 references indexed in Scilit:
- Resolving data sparsity and cold start problem in collaborative filtering recommender system using Linked Open DataExpert Systems with Applications, 2020
- A matrix factorization based dynamic granularity recommendation with three-way decisionsKnowledge-Based Systems, 2020
- How to Make Latent Factors Interpretable by Feeding Factorization Machines with Knowledge Graphs2019
- A novel matrix factorization model for recommendation with LOD-based semantic similarity measureExpert Systems with Applications, 2019
- A survey of frequent subgraph mining algorithmsThe Knowledge Engineering Review, 2012
- Building data warehouses with semantic web dataDecision Support Systems, 2012
- Matrix Factorization Techniques for Recommender SystemsComputer, 2009
- A survey of graph edit distancePattern Analysis and Applications, 2009
- Toward principles for the design of ontologies used for knowledge sharing?International Journal of Human-Computer Studies, 1995
- Mining association rules between sets of items in large databases1993