arXiv:2101.11972
PSpan:Mining Frequent Subnets of Petri Nets
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Efficient Parallel Genetic Algorithm for Perturbed Substructure Optimization in Complex Network
Correlation-Aware Graph Convolutional Networks for Multi-Label Node Classification
Higher-Order GNNs Meet Efficiency: Sparse Sobolev Graph Neural Networks
Accurate and Fast Estimation of Temporal Motifs using Path Sampling
Refining Wikidata Taxonomy using Large Language Models
A Versatile Framework for Attributed Network Clustering via K-Nearest Neighbor Augmentation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.