Database Paper Browser

Back to papers

Mining Frequent Infix Patterns from Concurrency-Aware Process Execution Variants

Summary: Reduce frequent-pattern mining over concurrency-aware variants—variants modeling partially ordered, overlapping activities—to frequent subtree mining. Present a tailored algorithm that outperforms a state-of-the-art frequent-subtree miner on real-world event logs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13111
Venue
VLDB
Year
2023
Pagerank
4.1945683e-05
Overall Rank
11,246 | 21.77%
DOI
10.14778/3603581.3603603

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
36 Fast Algorithms for Mining Association Rules 1994 VLDB 0.00076161096
Previous Page 1 / 1 Next

Semantically Similar Papers