What Is Frequent in a Single Graph?-Reference-Cited by-同舟云学术

What Is Frequent in a Single Graph?

Published: Issue: Volume: Page:858-863
ISSN:
Container-title:Advances in Knowledge Discovery and Data Mining
language:
Short-container-title:

Author:

Bringmann Björn,Nijssen Siegfried

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-68125-0_84.pdf

Reference10 articles.

1. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI/MIT Press (1996)

2. Bringmann, B., Nijssen, S.: What is frequent in a single graph? In: International Workshop on Mining and Learning with Graphs (MLG) (2007)

3. Busygin, S.: A new trust region technique for the maximum weight clique problem. Discrete Applied Mathematics 154, 2080–2096 (2006)

4. Lecture Notes in Artificial Intelligence;C. Chen,2007

5. Fiedler, M., Borgelt, C.: Support computation for mining frequent subgraphs in a single graph. In: International Workshop on Mining and Learning with Graphs (MLG) (2007)

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

1. Supports estimation via graph sampling;Expert Systems with Applications;2024-04

2. Discovering Graph Differential Dependencies;Lecture Notes in Computer Science;2023-11-07

3. Unfolding temporal networks through statistically significant graph evolution rules;2023 IEEE 10th International Conference on Data Science and Advanced Analytics (DSAA);2023-10-09

4. Accelerating Graph Mining Systems with Subgraph Morphing;Proceedings of the Eighteenth European Conference on Computer Systems;2023-05-08

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