MaNIACS-Reference-Cited by-同舟云学术

MaNIACS

Published:2021-08-14 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining
language:
Short-container-title:

Author:

Preti Giulia¹,De Francisci Morales Gianmarco¹,Riondato Matteo²

Affiliation:

1. ISI Foundation, Turin, Italy

2. Amherst College, Amherst, MA, USA

Funder

National Science Foundation

Publisher

ACM

Link

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

Reference61 articles.

1. I. Alobaidi J. Leopold and A. Allami. 2019. The Use of Frequent Subgraph Mining to Develop a Recommender System for Playing Real-Time Strategy Games. In ICDM. 146--160. I. Alobaidi J. Leopold and A. Allami. 2019. The Use of Frequent Subgraph Mining to Develop a Recommender System for Playing Real-Time Strategy Games. In ICDM. 146--160.

2. S.K. Bera and C. Seshadhri. 2020. How to Count Triangles without Seeing the Whole Graph. In KDD. 306--316. S.K. Bera and C. Seshadhri. 2020. How to Count Triangles without Seeing the Whole Graph. In KDD. 306--316.

3. Ap-FSM: A parallel algorithm for approximate frequent subgraph mining using Pregel

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. LearnSC: An Efficient and Unified Learning-Based Framework for Subgraph Counting Problem;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

2. An adaptive graph sampling framework for graph analytics;Social Network Analysis and Mining;2023-12-06

3. Learning heterogeneous subgraph representations for team discovery;Information Retrieval Journal;2023-10-09

4. MaNIACS : Approximate Mining of Frequent Subgraph Patterns through Sampling;ACM Transactions on Intelligent Systems and Technology;2023-04-13

5. VC-dimension and Rademacher Averages of Subgraphs, with Applications to Graph Mining;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04