MaNIACS : Approximate Mining of Frequent Subgraph Patterns through Sampling

Author:

Preti Giulia1ORCID,De Francisci Morales Gianmarco1ORCID,Riondato Matteo2ORCID

Affiliation:

1. CENTAI, Turin, Italy

2. Amherst College, Amherst, MA

Abstract

We present MaNIACS , a sampling-based randomized algorithm for computing high-quality approximations of the collection of the subgraph patterns that are frequent in a single, large, vertex-labeled graph, according to the Minimum Node Image-based (MNI) frequency measure. The output of MaNIACS comes with strong probabilistic guarantees, obtained by using the empirical Vapnik–Chervonenkis (VC) dimension, a key concept from statistical learning theory, together with strong probabilistic tail bounds on the difference between the frequency of a pattern in the sample and its exact frequency. MaNIACS leverages properties of the MNI-frequency to aggressively prune the pattern search space, and thus to reduce the time spent in exploring subspaces that contain no frequent patterns. In turn, this pruning leads to better bounds to the maximum frequency estimation error, which leads to increased pruning, resulting in a beneficial feedback effect. The results of our experimental evaluation of MaNIACS on real graphs show that it returns high-quality collections of frequent patterns in large graphs up to two orders of magnitude faster than the exact algorithm.

Funder

National Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Theoretical Computer Science

Reference69 articles.

1. E. Abdelhamid, I. Abdelaziz, P. Kalnis, Z. Khayyat, and F. Jamour. 2016. Scalemine: Scalable parallel frequent subgraph mining in a single large graph. In Proceedings of the SC.

2. 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 Proceedings of the ICDM. 146–160.

3. Ç. Aslay, M. A. U. Nasir, G. De Francisci Morales, and A. Gionis. 2018. Mining frequent patterns in evolving graphs. In Proceedings of the CIKM. 923–932.

4. S. K. Bera and C. Seshadhri. 2020. How to count triangles, without seeing the whole graph. In Proceedings of the KDD. 306–316.

5. Ap-FSM: A parallel algorithm for approximate frequent subgraph mining using Pregel;Bhatia V.;Expert Systems with Applications,2018

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3