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

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

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 Mining), a Spark based parallel frequent subgraph minin...

Bibliografske podrobnosti
Main Authors:	Fengcai Qiao, Xin Zhang, Pei Li, Zhaoyun Ding, Shanshan Jia, Hui Wang
Format:	Article
Jezik:	English
Izdano:	MDPI AG 2018-02-01
Serija:	Applied Sciences
Teme:	frequent subgraph mining parallel, algorithm constraint satisfaction problem Spark
Online dostop:	http://www.mdpi.com/2076-3417/8/2/230

Podobne knjige/članki

An Optimization of Closed Frequent Subgraph Mining Algorithm
od: Demetrovics J., et al.
Izdano: (2017-03-01)

Dynamic frequent subgraph mining algorithms over evolving graphs: a survey
od: Belgin Ergenç Bostanoğlu, et al.
Izdano: (2024-10-01)

High Performance Frequent Subgraph Mining on Transaction Datasets: A Survey and Performance Comparison
od: Bismita S. Jena, et al.
Izdano: (2019-09-01)

A qualitative survey on frequent subgraph mining
od: Güvenoglu Büsra, et al.
Izdano: (2018-12-01)

A scalable CPU-MIC coordinated drug-finding tool by frequent subgraph mining
od: Shaoliang PENG, et al.
Izdano: (2019-03-01)

Large Graph Sampling Algorithm for Frequent Subgraph Mining
od: Tianyu Zheng, et al.
Izdano: (2021-01-01)

A Method for Closed Frequent Subgraph Mining in a Single Large Graph
od: Lam B. Q. Nguyen, et al.
Izdano: (2021-01-01)

FSM-BC-BSP: Frequent Subgraph Mining Algorithm Based on BC-BSP
od: Fangling Leng, et al.
Izdano: (2024-04-01)

RASMA: a reverse search algorithm for mining maximal frequent subgraphs
od: Saeed Salem, et al.
Izdano: (2021-03-01)

Enhancing Recommender Systems with Semantic User Profiling through Frequent Subgraph Mining on Knowledge Graphs
od: Haemin Jung, et al.
Izdano: (2023-09-01)

cmFSM: a scalable CPU-MIC coordinated drug-finding tool by frequent subgraph mining
od: Shunyun Yang, et al.
Izdano: (2018-05-01)

Learning Knowledge Using Frequent Subgraph Mining from Ontology Graph Data
od: Kwangyon Lee, et al.
Izdano: (2021-01-01)

Semantic Image Collection Summarization With Frequent Subgraph Mining
od: Andrea Pasini, et al.
Izdano: (2022-01-01)

Fault diagnosis and auto dispatchin of power communication network based on unsupervised clustering and frequent subgraph mining
od: Jihua WU, et al.
Izdano: (2021-11-01)

Fault diagnosis and auto dispatchin of power communication network based on unsupervised clustering and frequent subgraph mining
od: Jihua WU, et al.
Izdano: (2021-11-01)

CCGraMi: An Effective Method for Mining Frequent Subgraphs in a Single Large Graph
od: Lam B. Q. Nguyen, et al.
Izdano: (2021-12-01)

Optimized and Frequent Subgraphs: How Are They Related?
od: Saif Ur Rehman, et al.
Izdano: (2018-01-01)

Depression Classification Using Frequent Subgraph Mining Based on Pattern Growth of Frequent Edge in Functional Magnetic Resonance Imaging Uncertain Network
od: Yao Li, et al.
Izdano: (2022-04-01)

Detecting Incremental Frequent Subgraph Patterns in IoT Environments
od: Kyoungsoo Bok, et al.
Izdano: (2018-11-01)

Event Graph-Based News Clustering: The Role of Named Entity-Centered Subgraphs
od: Basak Buluz Komecoglu, et al.
Izdano: (2024-01-01)

Recursive-Parallel Algorithm for Solving the Graph-Subgraph Isomorphism Problem
od: Vladimir V. Vasilchikov
Izdano: (2022-03-01)

An Efficient Spark-Based Hybrid Frequent Itemset Mining Algorithm for Big Data
od: Mohamed Reda Al-Bana, et al.
Izdano: (2022-01-01)

Mining contextually meaningful subgraphs from a vertex-attributed graph
od: Riyad Hakim, et al.
Izdano: (2024-11-01)

An Efficient Subgraph Isomorphism Solver for Large Graphs
od: Zubair Ali Ansari, et al.
Izdano: (2021-01-01)

Ekstraksi Frasa Kunci pada Penggabungan Klaster berdasarkan Maximum-Common-Subgraph
od: Adhi Nurilham, et al.
Izdano: (2018-09-01)

Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem
od: Vladimir V. Vasilchikov
Izdano: (2023-06-01)

Algorithms for Densest Subgraphs of Vertex-Weighted Graphs
od: Zhongling Liu, et al.
Izdano: (2024-07-01)

Parallel Incremental Mining of Regular-Frequent Patterns from WSNs Big Data
od: Sadegh Rahmani-Boldaji, et al.
Izdano: (2023-11-01)

A Distributed Algorithm for Fast Mining Frequent Patterns in Limited and Varying Network Bandwidth Environments
od: Chun-Cheng Lin, et al.
Izdano: (2019-05-01)

Coverability of Graphs by Parity Regular Subgraphs
od: Mirko Petruševski, et al.
Izdano: (2021-01-01)

Representing Graphs as Bag of Vertices and Partitions for Graph Classification
od: Mansurul Bhuiyan, et al.
Izdano: (2018-06-01)

Towards Enhancing the Performance of Parallel FP-Growth on Spark
od: Amr Essam, et al.
Izdano: (2022-01-01)

Parallel Frequent Subtrees Mining Method by an Effective Edge Division Strategy
od: Jing Wang, et al.
Izdano: (2022-05-01)

Mosar: Efficiently Characterizing Both Frequent and Rare Motifs in Large Graphs
od: Wenhua Guo, et al.
Izdano: (2022-07-01)

AN EFFICIENT ALGORITHM FOR MINING FREQUENT ITEM-SETS CONTAINING A CONSTRAINT SUBSET
od: Dương Văn Hải, et al.
Izdano: (2013-06-01)

Frequent Itemset Mining in Big Data With Effective Single Scan Algorithms
od: Youcef Djenouri, et al.
Izdano: (2018-01-01)

Automatic Semantic Modeling for Structural Data Source with the Prior Knowledge from Knowledge Base
od: Jiakang Xu, et al.
Izdano: (2022-12-01)

On Monochromatic Subgraphs of Edge-Colored Complete Graphs
od: Andrews Eric, et al.
Izdano: (2014-02-01)

A note on the generator subgraph of a graph
od: Neil Mores Mame, et al.
Izdano: (2020-04-01)

Heavy Subgraph Conditions for Longest Cycles to Be Heavy in Graphs
od: Lia Binlong, et al.
Izdano: (2016-05-01)