DBScholar

Back to papers

Mining Frequent Infix Patterns from Concurrency-Aware Process Execution Variants

Summary: Introduces frequent infix-pattern mining over concurrency-aware process variants, where executions are partially ordered rather than sequential. The key reduction to frequent subtree mining enables efficient discovery and outperforms a state-of-the-art method on real event logs. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
13299
Venue
VLDB
Year
2023
Pagerank
5.093636e-05
Overall Rank
11,446 | 21.48%
DOI
10.14778/3603581.3603603

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{martini_vldb23,
        title = {{Mining Frequent Infix Patterns from Concurrency-Aware Process Execution Variants}},
        author = {Martini, Michael and Schuster, Daniel and van der Aalst, Wil M.P.},
        journal = {PVLDB},
        series = {{VLDB} '23},
        volume = {16},
        number = {10},
        pages = {2666--2678},
        doi = {10.14778/3603581.3603603},
        url = {https://doi.org/10.14778/3603581.3603603},
        year = {2023}
}

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
27 Fast Algorithms for Mining Association Rules 1994 VLDB 0.00052255472
Previous Page 1 / 1 Next

Semantically Similar Papers