Frequent pattern mining in big social graphs

L Li, P Ding, H Chen, X Wu - IEEE Transactions on Emerging …, 2021 - ieeexplore.ieee.org
With the popularity of graph applications, frequent pattern mining (FPM) has been playing a
significant role in many domains, such as social networks and bioinformatics. However, due …

A cost-effective approach for mining near-optimal top-k patterns

X Wang, Z Lan, YA He, Y Wang, ZG Liu… - Expert Systems with …, 2022 - Elsevier
Frequent pattern mining (FPM) on large graphs has received more and more attention due
to its importance in various applications, including social media analysis. The FPM models …

Online social network trend discovery using frequent subgraph mining

SU Rehman, S Asghar - Social Network Analysis and Mining, 2020 - Springer
Graph mining has become a well-established discipline within the domain of data mining. It
has received much interest over the last decade as advances in computer hardware have …

Mining Top-k Frequent Patterns in Large Geosocial Networks: A Mnie-Based Extension Approach

C Zhou, J Xu, M Jiang, D Tang, S Wang - IEEE Access, 2023 - ieeexplore.ieee.org
Frequent pattern mining (FPM) has played an important role in many graph domains, such
as bioinformatics and social networks. In this paper, we focus on geo-social graphs, a kind of …

Supports estimation via graph sampling

X Wang, JH Shi, JJ Zou, LZ Shen, Z Lan, Y Fang… - Expert Systems with …, 2024 - Elsevier
Frequent pattern mining (FPM), whose goal is to identify patterns with appearance
frequencies above a specified support threshold on a large graph, has attracted increasing …

Fast and scalable algorithms for mining subgraphs in a single large graph

LBQ Nguyen, B Vo, NT Le, V Snasel… - Engineering Applications of …, 2020 - Elsevier
Mining frequent subgraphs is an important issue in graph mining. It is defined as finding all
subgraphs whose occurrences in the dataset are greater than or equal to a given frequency …

A weight-based approach: frequent graph pattern mining with length-decreasing support constraints using weighted smallest valid extension

G Lee, U Yun, D Kim - Advanced Science Letters, 2016 - ingentaconnect.com
As one of the recent interesting areas in data mining, frequent graph pattern (or sub-graphs)
mining was proposed to deal with more complicated data such as graphs. Moreover, in …

Distributed frequent subgraph mining on evolving graph using SPARK

N Senthilselvan, V Subramaniyaswamy… - Intelligent Data …, 2020 - content.iospress.com
Within the graph mining context, frequent subgraph identification plays a key role in
retrieving required information or patterns from the huge amount of data in a short period …

T-FSM: A task-based system for massively parallel frequent subgraph pattern mining from a big graph

L Yuan, D Yan, W Qu, S Adhikari, J Khalil… - Proceedings of the …, 2023 - dl.acm.org
Finding frequent subgraph patterns in a big graph is an important problem with many
applications such as classifying chemical compounds and building indexes to speed up …

Extending association rules with graph patterns

X Wang, Y Xu, H Zhan - Expert Systems with Applications, 2020 - Elsevier
We propose a general class of graph-pattern association rules (GPARs) for social network
analysis. Extending association rules for itemsets, GPARs can help us discover associations …