conference paper
Mining Invisible Tasks in Non-free-choice Constructs
Qinlong Guoa, Lijie Wena✉, Jianmin Wanga, Zhiqiang Yanb, Philip S. Yuc d
- aSchool of Software, Tsinghua University, Beijing, China
- bInformation School, Capital University of Economics and Business, Beijing, China
- cDepartment of Computer Science, University of Illinois at Chicago, Chicago, USA
- dInstitue for Data Science, Tsinghua University, Beijing, China
- ✉Corresponding author
Lecture notes in computer scienceSpringer Science+Business Media2015-01-01 70 citations21 references
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRAn algorithm namedalpha, implemented as a plug-in of ProM, is able to solve the problem of invisible task and non-free-choice construct mining by introducing new ordering relations between tasks. (Semantic Scholar)

