Referenced Items are not available for this document.
The current GPM algorithm needs many iterations to get good process models with high fitness which makes the GPM algorithm usually time-consuming and sometimes the result can not be accepted. To mine higher quality model in shorter time, a heuristic solution by adding log-replay based crossover operator and direct/indirect dependency relation based mutation operator is put forward. Experiment results on 25 benchmark logs show encouraging results.
Published in:
Computational Intelligence and Security (CIS), 2011 Seventh International Conference on
Date of Conference: 3-4 Dec. 2011
- Page(s):
- 15 - 19
- Print ISBN:
- 978-1-4577-2008-6
- INSPEC Accession Number:
- 12485902
- Conference Location :
- Hainan
- Digital Object Identifier :
- 10.1109/CIS.2011.12
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
