Spring ?2015 Report #021 – 03/26/15 JianjianWu
I. Plan for next week(***, **, *: order of priority)
? 50%:Complete 80% of Alpha algorithm
? 50%:Read two papers about Alpha algorithm
II. Tasks achieved this week(***, **, *: order of priority)
? 50%:Write Alpha algorithm and complete 60% of it
? 50%:Read two papers about Alpha algorithm
III.Feedback of Prof. Qiu Prof. Li and Dr. Yan last week
? Achieve α-algorithm
? Read more papers about Alpha algorithm
IV. Reports
? The first paper that I read is:
LiangYan ,WangXin-Fang,HuXian-Zhi.Improved α-algorithm for mining workflow models [J].computer engineering and design 2009.30(9):2191-2194
This paper improved α-algorithm and could explore short cycle that length of
one, because α-algorithm ignore the types of event; but it couldn’t explore
short cycle that length of two.
? The second paper that I read is:
Liu Rui, Jiang Ming Hu . Design and implementation of process mining system based on α-algorithm [M].Software Guide,2008,7(7):66-69
This paper propose the method to realize α-algorithm is very clever , it use two queue to compare thus merge the inclusion relation .But this paper just simply described the realization of α-
algorithm ,it not give the specific treatment ,and it couldn’t discover short cycle.
? The primary realization of α-algorithm:
Input :
ABDCEF ABDECF ADBCEF ADBECF ADEBCF
Petri net that I have realized:
V. Mile-Stone:
? Implement Alpha algorithm
? Complete one paper about process mining
