High Performance Frequent Subgraph Mining on Transaction Datasets: A Survey and Performance Comparison
Graph data mining has been a crucial as well as inevitable area of research. Large amounts of graph data are produced in many areas, such as Bioinformatics, Cheminformatics, Social Networks, etc. Scalable graph data mining methods are getting increasingly popular and necessary due to increased graph...
Saved in:
Main Authors: | Bismita S. Jena, Cynthia Khan, Rajshekhar Sunderraman |
---|---|
Format: | Article |
Language: | English |
Published: |
Tsinghua University Press
2019-09-01
|
Series: | Big Data Mining and Analytics |
Subjects: | |
Online Access: | https://www.sciopen.com/article/10.26599/BDMA.2019.9020006 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An efficient and resilience linear prefix approach for mining maximal frequent itemset using clustering
by: M. Sinthuja, et al.
Published: (2025-03-01) -
AN EFFICIENT ALGORITHM FOR MINING FREQUENT ITEM-SETS CONTAINING A CONSTRAINT SUBSET
by: Dương Văn Hải, et al.
Published: (2013-06-01) -
An Efficient Approach to Mining Maximal Contiguous Frequent Patterns from Large DNA Sequence Databases
by: Md. Rezaul Karim, et al.
Published: (2012-03-01) -
From paths to stars
by: A. F. Alameddine
Published: (1991-01-01) -
Unveiling risk factors: a prognostic model of frequent peritonitis in peritoneal dialysis patients
by: Qi-jiang Xu, et al.
Published: (2025-01-01)