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 条
  • [1] ScaleMine: Scalable Parallel Frequent Subgraph Mining in a Single Large Graph
    Abdelhamid, Ehab
    Abdelaziz, Ibrahim
    Kalnis, Panos
    Khayyat, Zuhair
    Jamour, Fuad
    SC '16: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS, 2016, : 716 - 726
  • [2] A Parallel Approach for Frequent Subgraph Mining in a Single Large Graph Using Spark
    Qiao, Fengcai
    Zhang, Xin
    Li, Pei
    Ding, Zhaoyun
    Jia, Shanshan
    Wang, Hui
    APPLIED SCIENCES-BASEL, 2018, 8 (02):
  • [3] Optimizing Frequent Subgraph Mining for Single Large Graph
    Dhiman, Aarzoo
    Jain, S. K.
    TWELFTH INTERNATIONAL CONFERENCE ON COMMUNICATION NETWORKS, ICCN 2016 / TWELFTH INTERNATIONAL CONFERENCE ON DATA MINING AND WAREHOUSING, ICDMW 2016 / TWELFTH INTERNATIONAL CONFERENCE ON IMAGE AND SIGNAL PROCESSING, ICISP 2016, 2016, 89 : 378 - 385
  • [4] GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph
    Elseidy, Mohammed
    Abdelhamid, Ehab
    Skiadopoulos, Spiros
    Kalnis, Panos
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2014, 7 (07): : 517 - 528
  • [5] POSGRAMI: Possibilistic Frequent Subgraph Mining in a Single Large Graph
    Moussaoui, Mohamed
    Zaghdoud, Montaceur
    Akaichi, Jalel
    INFORMATION PROCESSING AND MANAGEMENT OF UNCERTAINTY IN KNOWLEDGE-BASED SYSTEMS, IPMU 2016, PT I, 2016, 610 : 549 - 561
  • [6] A Method for Closed Frequent Subgraph Mining in a Single Large Graph
    Nguyen, Lam B. Q.
    Nguyen, Loan T. T.
    Zelinka, Ivan
    Snasel, Vaclav
    Hung Son Nguyen
    Bay Vo
    IEEE ACCESS, 2021, 9 : 165719 - 165733
  • [7] Large Graph Sampling Algorithm for Frequent Subgraph Mining
    Zheng, Tianyu
    Li Wang
    IEEE ACCESS, 2021, 9 : 88970 - 88980
  • [8] A Parallel Algorithm for Frequent Subgraph Mining
    Bay Vo
    Dang Nguyen
    Thanh-Long Nguyen
    ADVANCED COMPUTATIONAL METHODS FOR KNOWLEDGE ENGINEERING, 2015, 358 : 163 - 173
  • [9] FSMBUS: A frequent subgraph mining algorithm in single large-scale graph using spark
    Yan, Yuliang
    Dong, Yihong
    He, Xianmang
    Wang, Wei
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2015, 52 (08): : 1768 - 1783
  • [10] Towards Frequent Subgraph Mining on Single Large Uncertain Graphs
    Chen, Yifan
    Zhao, Xiang
    Lin, Xuemin
    Wang, Yang
    2015 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2015, : 41 - 50
12345