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

PSpan:挖掘Petri网的频繁子网

PSpan:Mining Frequent Subnets of Petri Nets

Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);University of Chinese Academy of Sciences(中国科学院大学)

Ruqian Lu, Shuhan Zhang

摘要:

本文首次提出了一种从Petri网集合中挖掘频繁完备Petri网的算法PSpan。我们引入了完全图的概念和网图表示。PSpan将Petri网转化为网图,并对其进行子网图挖掘,然后将结果转换回频繁图。PSpan遵循模式增长方法,并具有与图挖掘中的gSpan相似的复杂性。实验验证了PSpan算法的可靠性和复杂性。除了C/E网,它也适用于一组其他Petri网子类。

英文摘要:

This paper proposes for the first time an algorithm PSpan for mining frequent complete subnets from a set of Petri nets. We introduced the concept of complete subnets and the net graph representation. PSpan transforms Petri nets in net graphs and performs sub-net graph mining on them, then transforms the results back to frequent subnets. PSpan follows the pattern growth approach and has similar complexity like gSpan in graph mining. Experiments have been done to confirm PSpan's reliability and complexity. Besides C/E nets, it applies also to a set of other Petri net subclasses.

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

↑