Subgraph mining in a large graph: A review-Reference-Cited by-同舟云学术

Subgraph mining in a large graph: A review

Published:2022-03-08 Issue:4 Volume:12 Page:
ISSN:1942-4787
Container-title:WIREs Data Mining and Knowledge Discovery
language:en
Short-container-title:WIREs Data Min & Knowl

Author:

Nguyen Lam B. Q.¹²^ORCID,Zelinka Ivan²³^ORCID,Snasel Vaclav²^ORCID,Nguyen Loan T. T.⁴⁵^ORCID,Vo Bay⁶^ORCID

Affiliation:

1. Faculty of Information and Communications Kien Giang University Vietnam

2. Faculty of Electrical Engineering and Computer Science VŠB‐Technical University of Ostrava Ostrava‐Poruba Czech Republic

3. Faculty of Electrical and Electronics Engineering Ton Duc Thang University Ho Chi Minh City Vietnam

4. School of Computer Science and Engineering International University Ho Chi Minh City Vietnam

5. Vietnam National University Ho Chi Minh City Vietnam

6. Faculty of Information Technology HUTECH University Ho Chi Minh City Vietnam

Publisher

Wiley

Subject

General Computer Science

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/widm.1454

Reference118 articles.

1. Abdelhamid E. Abdelaziz I. Kalnis P. Khayyat Z. &Jamour F.(2016).Scalemine: Scalable parallel frequent subgraph mining in a single large graph.SC'16:Proceedings of the International Conference for High Performance Computing Networking Storage and Analysis pp.716–727.

2. Acosta‐Mendoza N. Gago‐Alonso A. Carrasco‐Ochoa J. A. Martínez‐Trinidad J. F. &Medina‐Pagola J. E.(2017).Mining generalized closed patterns from multi‐graph collections.Iberoamerican Congress on Pattern Recognition pp.10–18.

3. Agrawal R. &Srikant R.(1994).Fast algorithms for mining association rules.Proceedings of the 20th International Conference onVery Large Data Bases (VLDB) 1215 pp.487–499.

4. A linear delay algorithm for enumerating all connected induced subgraphs;Alokshiya M.;BMC Bioinformatics,2019

5. An Efficient Subgraph Isomorphism Solver for Large Graphs

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

1. DeepDense: Enabling node embedding to dense subgraph mining;Expert Systems with Applications;2024-03

2. Discovery of User Groups Densely Connecting Virtual and Physical Worlds in Event-Based Social Networks;International Journal of Information Technologies and Systems Approach;2023-07-28

3. A novel approach to discover frequent weighted subgraphs using the average measure;Applied Intelligence;2023-03-08

4. Mining Association Rules from a Single Large Graph;Cybernetics and Systems;2023-01-18

5. Event Abstraction for Partial Order Patterns;Lecture Notes in Computer Science;2023