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 125 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An efficient approach for discovering Graph Entity Dependencies (GEDs);Information Systems;2024-11

2. HUSM: High utility subgraph mining in single graph databases;Information Sciences;2024-07

3. Mapping the Evolution and Future Trajectories of Network Mining: A Scientometric Analysis (2004–2023);2024 International Symposium on Power Electronics, Electrical Drives, Automation and Motion (SPEEDAM);2024-06-19

4. FSM-Explorer: An Interactive Tool for Frequent Subgraph Pattern Mining From a Big Graph;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

5. FSM-BC-BSP: Frequent Subgraph Mining Algorithm Based on BC-BSP;Applied Sciences;2024-04-09