Process Mining through Tree Automata

Michal R. Przybylek

2013

Abstract

This paper introduces a new approach to mine business processes. We define bi-directional tree languages together with their finite models and show how they represent business processes. Then we propose an evolutionary heuristic based on skeletal algorithms to learn bi-directional tree automata. We show how the heuristic can be used in process mining.

Paper Citation

in Harvard Style

R. Przybylek M. (2013). Process Mining through Tree Automata . In Proceedings of the 5th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2013) ISBN 978-989-8565-77-8, pages 152-159. DOI: 10.5220/0004555201520159

in Bibtex Style

@conference{ecta13,
author={Michal R. Przybylek},
title={Process Mining through Tree Automata},
booktitle={Proceedings of the 5th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2013)},
year={2013},
pages={152-159},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004555201520159},
isbn={978-989-8565-77-8},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2013)
TI - Process Mining through Tree Automata
SN - 978-989-8565-77-8
AU - R. Przybylek M.
PY - 2013
SP - 152
EP - 159
DO - 10.5220/0004555201520159