ScaleMine: Scalable Parallel Frequent Subgraph Mining in a Single Large Graph

被引：0

作者：

Abdelhamid, Ehab ^{[1
]}

Abdelaziz, Ibrahim ^{[1
]}

Kalnis, Panos ^{[1
]}

Khayyat, Zuhair ^{[1
]}

Jamour, Fuad ^{[1
]}

机构：

[1] KAUST, Comp Elect & Math Sci & Engn Div, Extreme Comp Res Ctr, Thuwal, Saudi Arabia

来源：

SC '16: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS | 2016年

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This artifact contains the source codes of ScaleMine as well as the scripts required for compiling and running it. ScaleMine is a parallel frequent subgraph mining system that is capable of running on a single machine, a cluster of machines or a supercomputer. It assumes that the input graph is formatted using the widely used Labeled Graph (LG) format. ScaleMine implements all the algorithms described in the paper: ScaleMine: Scalable Parallel Frequent Subgraph Mining in a Single Large Graph, SC16. To validate the results, compile the source code, run the test scripts and check the results in the corresponding output files.

引用

页码：727 / 727

页数：1

共 50 条

[31] A Graph Mining Approach for Ranking and Discovering the Interesting Frequent Subgraph Patterns
Saif Ur Rehman
Kexing Liu
Tariq Ali
Asif Nawaz
Simon James Fong
International Journal of Computational Intelligence Systems, 14
[32] SparkFSM: A Highly Scalable Frequent Subgraph Mining Approach using Apache Spark
Jena, Bismita S.
Khan, Cynthia
Sunderraman, Rajshekhar
2018 18TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING WORKSHOPS (ICDMW), 2018, : 990 - 997
[33] Generalization for frequent subgraph mining
Inokuchi, Akihiro
Washio, Takashi
Motoda, Hiroshi
Transactions of the Japanese Society for Artificial Intelligence, 2004, 19 (05) : 368 - 378
[34] Frequent Subgraph Mining on BigData
Sreedevi, K. M.
Hareesh, M. J.
Kunjachan, Honeytta
PROCEEDINGS OF THE 2018 SECOND INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND CONTROL SYSTEMS (ICICCS), 2018, : 555 - 560
[35] Frequent mining of subgraph structures
Guo, Ping
Wang, Xin-Ru
Kang, Yan-Rong
JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 2006, 18 (04) : 513 - 521
[36] Scalable maximal subgraph mining with backbone-preserving graph convolutions
Nguyen, Thanh Toan
Huynh, Thanh Trung
Weidlich, Matthias
Tho, Quan Thanh
Yin, Hongzhi
Aberer, Karl
Nguyen, Quoc Viet Hung
INFORMATION SCIENCES, 2023, 644
[37] Parallel Subgraph Listing in a Large-Scale Graph
Shao, Yingxia
Cui, Bin
Chen, Lei
Ma, Lin
Yao, Junjie
Xu, Ning
SIGMOD'14: PROCEEDINGS OF THE 2014 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2014, : 625 - 636
[38] DESSIN: Mining Dense Subgraph Patterns in a Single Graph
Li, Shirong
Zhang, Shijie
Yang, Jiong
SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT, 2010, 6187 : 178 - 195
[39] Application-Specific Graph Sampling for Frequent Subgraph Mining and Community Detection
Purohit, Sumit
Choudhury, Sutanay
Holder, Lawrence B.
2017 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2017, : 1000 - 1005
[40] Mining Top-K Frequent Correlated Subgraph Pairs in Graph Databases
Shang, Li
Jian, Yujiao
INTELLIGENT INFORMATICS, 2013, 182 : 1 - 8

← 1 2 3 4 5 →