Accelerating Graph Mining Systems with Subgraph Morphing-Reference-Cited by-同舟云学术

Accelerating Graph Mining Systems with Subgraph Morphing

Published:2023-05-08 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Eighteenth European Conference on Computer Systems
language:
Short-container-title:

Author:

Jamshidi Kasra¹^ORCID,Xu Harry²^ORCID,Vora Keval¹^ORCID

Affiliation:

1. School of Computing Science, Simon Fraser University, Burnaby, British Columbia, Canada

2. UCLA, Los Angeles, California, United States of America

Funder

Natural Sciences and Engineering Research Council of Canada

NSF (National Science Foundation)

Office of Naval Research

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3552326.3567489

Reference74 articles.

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

2. Ehab Abdelhamid , Mustafa Canim , Mohammad Sadoghi , Bishwaranjan Bhattacharjee , Yuan-Chi Chang , and Panos Kalnis. Incremental Frequent Subgraph Mining on Large Evolving Graphs. In 34th IEEE International Conference on Data Engineering, ICDE 2018 , Paris, France, April 16--19 , 2018 , pages 1767 -- 1768 , 2018. Ehab Abdelhamid, Mustafa Canim, Mohammad Sadoghi, Bishwaranjan Bhattacharjee, Yuan-Chi Chang, and Panos Kalnis. Incremental Frequent Subgraph Mining on Large Evolving Graphs. In 34th IEEE International Conference on Data Engineering, ICDE 2018, Paris, France, April 16--19, 2018, pages 1767--1768, 2018.

3. Nesreen K. Ahmed , Jennifer Neville , Ryan A. Rossi , and Nick G . Duffield. Efficient Graphlet Counting for Large Networks. In 2015 IEEE International Conference on Data Mining, ICDM 2015 , pages 1 -- 10 , 2015 . Nesreen K. Ahmed, Jennifer Neville, Ryan A. Rossi, and Nick G. Duffield. Efficient Graphlet Counting for Large Networks. In 2015 IEEE International Conference on Data Mining, ICDM 2015, pages 1--10, 2015.

4. Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows

5. CECI