SDM: A frequent subgraph mining algorithm for sequential directed graphs

Guoyu Tian; Aihua Wu

doi:10.1117/12.2652218

10 November 2022 SDM: A frequent subgraph mining algorithm for sequential directed graphs

Guoyu Tian, Aihua Wu

Proceedings Volume 12331, International Conference on Mechanisms and Robotics (ICMAR 2022); 123314N (2022) https://doi.org/10.1117/12.2652218
Event: International Conference on Mechanisms and Robotics (ICMAR 2022), 2022, Zhuhai, China

Abstract

Current research on frequent subgraph mining mainly focuses on the mining of undirected graphs, but in fact, the research on the mining of directed graphs has more practical significance. A new algorithm for mining frequent subgraphs based on directed graphs, SDM, is proposed. This algorithm uses breadth-first search strategy to mine frequent subgraphs by establishing a hierarchical tree space. And provide an efficient method in the process of frequent subgraph generation and counting. Experimental research shows that compared with other frequent subgraph mining algorithms, SDM has achieved a significant performance improvement.

Citation Download Citation

Guoyu Tian and Aihua Wu "SDM: A frequent subgraph mining algorithm for sequential directed graphs", Proc. SPIE 12331, International Conference on Mechanisms and Robotics (ICMAR 2022), 123314N (10 November 2022); https://doi.org/10.1117/12.2652218

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available