FreSCo: Mining Frequent Patterns in Simplicial Complexes-Reference-Cited by-同舟云学术

FreSCo: Mining Frequent Patterns in Simplicial Complexes

Published:2022-04-25 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the ACM Web Conference 2022
language:
Short-container-title:

Author:

Preti Giulia¹,De Francisci Morales Gianmarco¹,Bonchi Francesco²

Affiliation:

1. ISI Foundation, Italy

2. ISI Foundation, Italy and Eurecat, Spain

Publisher

ACM

Link

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

Reference51 articles.

1. Ehab Abdelhamid Ibrahim Abdelaziz Panos Kalnis Zuhair Khayyat and Fuad Jamour. 2016. ScaleMine: Scalable parallel frequent subgraph mining in a single large graph. In SC. 716–727. Ehab Abdelhamid Ibrahim Abdelaziz Panos Kalnis Zuhair Khayyat and Fuad Jamour. 2016. ScaleMine: Scalable parallel frequent subgraph mining in a single large graph. In SC. 716–727.

2. Rakesh Agrawal and Ramakrishnan Srikant. 1994. Fast Algorithms for Mining Association Rules in Large Databases. In VLDB. 487–499. Rakesh Agrawal and Ramakrishnan Srikant. 1994. Fast Algorithms for Mining Association Rules in Large Databases. In VLDB. 487–499.

3. Friendship prediction and homophily in social media

4. Md Alam Chowdhury Farhan Ahmed Md Samiullah Carson K Leung 2021. Discriminating frequent pattern based supervised graph embedding for classification. In PAKDD. 16–28. Md Alam Chowdhury Farhan Ahmed Md Samiullah Carson K Leung 2021. Discriminating frequent pattern based supervised graph embedding for classification. In PAKDD. 16–28.

5. Vikraman Arvind Bireswar Das Johannes Köbler and Seinosuke Toda. 2010. Colored hypergraph isomorphism is fixed parameter tractable. In FSTTCS. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Vikraman Arvind Bireswar Das Johannes Köbler and Seinosuke Toda. 2010. Colored hypergraph isomorphism is fixed parameter tractable. In FSTTCS. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

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

1. Hypergraph motifs and their extensions beyond binary;The VLDB Journal;2023-12-26

2. Exact and sampling methods for mining higher-order motifs in large hypergraphs;Computing;2023-10-20

3. Characterization of Simplicial Complexes by Counting Simplets Beyond Four Nodes;Proceedings of the ACM Web Conference 2023;2023-04-30