Skip to Content

14 Results Found

  • Article
  • Open Access
36 Citations
8,551 Views
18 Pages

A Parallel Approach for Frequent Subgraph Mining in a Single Large Graph Using Spark

  • Fengcai Qiao,
  • Xin Zhang,
  • Pei Li,
  • Zhaoyun Ding and ,
  • Shanshan Jia and
  • Hui Wang
  • + 1 author+ 0 author

2 February 2018

Frequent subgraph mining (FSM) plays an important role in graph mining, attracting a great deal of attention in many areas, such as bioinformatics, web data mining and social networks. In this paper, we propose SSiGraM (Spark based Single Graph Minin...

(This article belongs to the Special Issue Socio-Cognitive and Affective Computing)
  • Article
  • Open Access
13 Citations
5,886 Views
17 Pages

6 September 2023

Recommender systems play a crucial role in personalizing online user experiences by creating user profiles based on user–item interactions and preferences. Knowledge graphs (KGs) are intricate data structures that encapsulate semantic informati...

  • Article
  • Open Access
2 Citations
2,105 Views
27 Pages

An Algorithm for Mining Frequent Approximate Subgraphs with Structural and Label Variations in Graph Collections

  • Daybelis Jaramillo-Olivares,
  • Jesús Ariel Carrasco-Ochoa and
  • José Francisco Martínez-Trinidad

15 July 2025

Using graphs as a data structure is a simple way to represent relationships between objects. Consequently, it has raised the need for algorithms to process, analyze, and extract meaningful information from graphs. Therefore, frequent subgraph mining...

  • Article
  • Open Access
11 Citations
4,913 Views
28 Pages

Learning Knowledge Using Frequent Subgraph Mining from Ontology Graph Data

  • Kwangyon Lee,
  • Haemin Jung,
  • June Seok Hong and
  • Wooju Kim

20 January 2021

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 f...

(This article belongs to the Section Computing and Artificial Intelligence)
  • Article
  • Open Access
3 Citations
3,944 Views
17 Pages

FSM-BC-BSP: Frequent Subgraph Mining Algorithm Based on BC-BSP

  • Fangling Leng,
  • Fan Li,
  • Yubin Bao,
  • Tiancheng Zhang and
  • Ge Yu

9 April 2024

As graph models become increasingly prevalent in the processing of scientific data, the exploration of effective methods for the mining of meaningful patterns from large-scale graphs has garnered significant research attention. This paper delves into...

(This article belongs to the Special Issue Deep Learning for Graph Management and Analytics)
  • Article
  • Open Access
4 Citations
2,945 Views
19 Pages

Automatic Semantic Modeling for Structural Data Source with the Prior Knowledge from Knowledge Base

  • Jiakang Xu,
  • Wolfgang Mayer,
  • Hongyu Zhang,
  • Keqing He and
  • Zaiwen Feng

15 December 2022

A critical step in sharing semantic content online is to map the structural data source to a public domain ontology. This problem is denoted as the Relational-To-Ontology Mapping Problem (Rel2Onto). A huge effort and expertise are required for manual...

(This article belongs to the Special Issue Advances in Data Mining, Machine Learning and Causal Inference and Their Applications)
  • Article
  • Open Access
1 Citations
2,640 Views
21 Pages

Meta-Interpretive LEarning with Reuse

  • Rong Wang,
  • Jun Sun,
  • Cong Tian and
  • Zhenhua Duan

20 March 2024

Inductive Logic Programming (ILP) is a research field at the intersection between machine learning and logic programming, focusing on developing a formal framework for inductively learning relational descriptions in the form of logic programs from ex...

  • Article
  • Open Access
11 Citations
5,563 Views
14 Pages

2 April 2018

Recently, Multi-Graph Learning was proposed as the extension of Multi-Instance Learning and has achieved some successes. However, to the best of our knowledge, currently, there is no study working on Multi-Graph Multi-Label Learning, where each objec...

(This article belongs to the Special Issue Entropy-based Data Mining)
  • Article
  • Open Access
9 Citations
7,366 Views
26 Pages

6 May 2016

Frequent graph mining has been proposed to find interesting patterns (i.e., frequent sub-graphs) from databases composed of graph transaction data, which can effectively express complex and large data in the real world. In addition, various applicati...

(This article belongs to the Special Issue Symmetry in Complex Networks II)
  • Article
  • Open Access
3 Citations
2,326 Views
20 Pages

Mining Spatial-Temporal Frequent Patterns of Natural Disasters in China Based on Textual Records

  • Aiai Han,
  • Wen Yuan,
  • Wu Yuan,
  • Jianwen Zhou and ,
  • Xueyan Jian,
  • Rong Wang and
  • Xinqi Gao
  • + 2 authors+ 0 author

27 June 2024

Natural disasters pose serious threats to human survival. With global warming, disaster chains related to extreme weather are becoming more common, making it increasingly urgent to understand the relationships between different types of natural disas...

  • Article
  • Open Access
2 Citations
6,308 Views
31 Pages

Directed graphs can be prepared from big data containing peoples’ interaction information. In these graphs the vertices represent people, while the directed edges denote the interactions among them. The number of interactions at certain intervals can...

  • Article
  • Open Access
6 Citations
2,944 Views
19 Pages

Hypergraph-Clustering Method Based on an Improved Apriori Algorithm

  • Rumeng Chen,
  • Feng Hu,
  • Feng Wang and
  • Libing Bai

22 September 2023

With the complexity and variability of data structures and dimensions, traditional clustering algorithms face various challenges. The integration of network science and clustering has become a popular field of exploration. One of the main challenges...

  • Review
  • Open Access
4 Citations
4,246 Views
36 Pages

The increasing scale and complexity of data mining outputs, such as frequent itemsets, association rules, sequences, and subgraphs have made efficient pattern retrieval a critical, yet underexplored challenge. This review addresses the organisation,...

  • Article
  • Open Access
1 Citations
5,408 Views
35 Pages

Use the K-Neighborhood Subgraphs to Compute Canonical Labelings of Graphs

  • Jianqiang Hao,
  • Yunzhan Gong,
  • Jianzhi Sun and
  • Li Tan

1 August 2019

This paper puts forward an innovative theory and method to calculate the canonical labelings of graphs that are distinct to N a u t y ’s. It shows the correlation between the canonical labeling of a graph and the canonical labeling of it...