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 条
  • [41] Learning Knowledge Using Frequent Subgraph Mining from Ontology Graph Data
    Lee, Kwangyon
    Jung, Haemin
    Hong, June Seok
    Kim, Wooju
    APPLIED SCIENCES-BASEL, 2021, 11 (03): : 1 - 29
  • [42] Incremental Frequent Subgraph Mining on Large Evolving Graphs (Extended abstract)
    Abdelhamid, Ehab
    Canim, Mustafa
    Sadoghi, Mohammad
    Bhattacharjee, Bishwaranjan
    Chang, Yuan-Chi
    Kalnis, Panos
    2018 IEEE 34TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2018, : 1767 - 1768
  • [43] SubISO: A Scalable and Novel Approach for Subgraph Isomorphism Search in Large Graph
    Abulaish, Muhammad
    Ansari, Zubair Ali
    Jahiruddin
    2019 11TH INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS & NETWORKS (COMSNETS), 2019, : 137 - 144
  • [44] Frequent subgraph mining in outerplanar graphs
    Tamás Horváth
    Jan Ramon
    Stefan Wrobel
    Data Mining and Knowledge Discovery, 2010, 21 : 472 - 508
  • [45] HUSM: High utility subgraph mining in single graph databases
    Chen, Zhaoming
    He, Cheng
    Chen, Guoting
    Gan, Wensheng
    Fournier-Viger, Philippe
    INFORMATION SCIENCES, 2024, 675
  • [46] Frequent Subgraph Mining Based on Pregel
    Zhao, Xiang
    Chen, Yifan
    Xiao, Chuan
    Ishikawa, Yoshiharu
    Tang, Jiuyang
    COMPUTER JOURNAL, 2016, 59 (08): : 1113 - 1128
  • [47] A survey of frequent subgraph mining algorithms
    Jiang, Chuntao
    Coenen, Frans
    Zito, Michele
    KNOWLEDGE ENGINEERING REVIEW, 2013, 28 (01): : 75 - 105
  • [48] The Gaston Tool for Frequent Subgraph Mining
    Nijssen, Siegfried
    Kok, Joost N.
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 127 (01) : 77 - 87
  • [49] Differentially Private Frequent Subgraph Mining
    Xu, Shengzhi
    Su, Sen
    Xiong, Li
    Cheng, Xiang
    Xiao, Ke
    2016 32ND IEEE INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2016, : 229 - 240
  • [50] Efficient frequent subgraph mining algorithm
    Li, Xian-Tong
    Li, Jian-Zhong
    Gao, Hong
    Ruan Jian Xue Bao/Journal of Software, 2007, 18 (10): : 2469 - 2480
12345