arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2112.09573cs.AI
收藏

cgSpan:基于封闭图的子结构模式挖掘

cgSpan: Closed Graph-Based Substructure Pattern Mining

Informatica(Informatica 公司);University of Wisconsin–Madison(威斯康星大学麦迪逊分校)

Zevin Shaul, Sheikh Naaz

摘要:

gSpan算法是一种常用的频繁子图挖掘算法。cgSpan(closed graph-based substructure pattern mining)是一个gSpan扩展,只挖掘闭子图。如果不存在一个与g等价出现的真频繁超图,则称g在图数据库中是闭的。cgSpan将Early Termination pruning方法添加到gSpan pruning方法中,同时保持原始gSpan步骤不变。cgSpan还检测和处理不应应用提前终止的情况。据我们所知,cgSpan是第一个公开的封闭图挖掘实现

英文摘要:

gSpan is a popular algorithm for mining frequent subgraphs. cgSpan (closed graph-based substructure pattern mining) is a gSpan extension that only mines closed subgraphs. A subgraph g is closed in the graphs database if there is no proper frequent supergraph of g that has equivalent occurrence with g. cgSpan adds the Early Termination pruning method to the gSpan pruning methods, while leaving the original gSpan steps unchanged. cgSpan also detects and handles cases in which Early Termination should not be applied. To the best of our knowledge, cgSpan is the first publicly available implementation for closed graphs mining

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑