skip to main content
research-article

RECYCLE: Learning looping workflows from annotated traces

Published:15 July 2011Publication History
Skip Abstract Section

Abstract

A workflow is a model of a process that systematically describes patterns of activity. Workflows capture a sequence of operations, their enablement conditions, and data flow dependencies among them. It is hard to design a complete and correct workflow from scratch, while it is much easier for humans to demonstrate the solution than to state the solution declaratively.

This article presents RECYCLE, our approach to learning workflow models from example demonstration traces. RECYCLE captures control flow, data flow, and enablement conditions of an underlying workflow process. Unlike prior work from workflow mining and AI planning literature, (1) RECYCLE can learn from a single demonstration trace with loops, (2) RECYCLE learns both loop and conditional branch structure, and (3) RECYCLE handles data flow among actions.

In this article, we describe the phases of RECYCLE's learning algorithm: substructure analysis and node abstraction. To ground the discussion, we present a simplified flight reservation system with some of the important characteristics of the real domains we worked with. We present some results from a patient transport domain.

References

  1. Aires da Silva, G. and Ferreira, D. R. 2009. Applying hidden Markov models to process mining. In Sistemas e Tecnologias de Informação: Actas da 4a. Conferência Ibérica de Sistemas e Tecnologias de Informação (CISTI). A. Rocha, F. Restivo, L. P. Reis, and S. Torrão Eds., 207--210.Google ScholarGoogle Scholar
  2. Aler, R., Borrajo, D., and Isasi, P. 2002. Using genetic programming to learn and improve control knowledge. Artifi. Intell. 141, 1, 29--56. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Berry, D. and Parastatidis, S., Eds. 2003. In Proceedings of the e-Science Workflow Services Workshop.Google ScholarGoogle Scholar
  4. Botea, A., Müller, M. E. M., and Schaeffer, J. 2005. Macro-FF: Improving AI planning with automatically learned macro-operators. J. Artif. Intell. Res. 24, 581--621. Google ScholarGoogle ScholarCross RefCross Ref
  5. Bowers, S., Ludäscher, B., Ngu, A. H. H., and Critchlow, T. 2006. Enabling scientific workflow reuse through structured composition of dataflow and control-flow. In Proceedings of the International Conference on Data Engineering Workshops (ICDEW). IEEE, Los Alamitos, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Burstein, M., Haigh, K. Z., Yaman, F., Bobrow, R., Benyo, B., Adler, A., Laddaga, R., and McDonald, D. 2010. POIROT -- Learning procedures by example for both execution and training. Tech. rep. 8512, BBN Technologies, Cambridge, MA.Google ScholarGoogle Scholar
  7. Burstein, M., Laddaga, R., McDonald, D., Cox, M., Benyo, B., Robertson, P., Hussain, T., Brinn, M., and McDermott, D. 2008. POIROT -- Integrated learning of Web service procedures. In Proceedings of the Conference on Artificial Intelligence (AAAI). AAAI Press, Menlo Park, CA, 1274--1279. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Coles, A. I. and Smith, A. J. 2007. Marvin: A heuristic search planner with online macro-action learning. J. Artif. Intell. Res. 28, 119--156. Google ScholarGoogle ScholarCross RefCross Ref
  9. Cook, J. E. and Wolf, A. L. 1995. Automating process discovery through event-data analysis. In Proceedings of the International Confer. Softw. Engin. ACM Press, New York, NY, 73--82. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. 1992. Introduction to Algorithms. MIT Press, Cambridge, MA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Dustdar, S. and Gombotz, R. 2007. Discovering Web service workflows using Web services interaction mining. Int. J. Bus. Process Integr. Manag. 1, 256--266.Google ScholarGoogle ScholarCross RefCross Ref
  12. Garcia, J. G., Lemaigre, C., Calleros, J. M. G., and Vanderdonckt, J. 2008. Model-Driven approach to design user interfaces for workflow information systems. J. Universal Comput. Sci. 14, 9, 3160--3173.Google ScholarGoogle Scholar
  13. Gervasio, M. T. and Murdock, J. L. 2009. What were you thinking? Filling in missing dataflow through inference in learning from demonstration. In Proceedings of the International Conference on Intelligent User Interfaces (IUI). ACM Press, New York, NY, 157--166. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Gil, Y., Deelman, E., Ellisman, M., Fahringer, T., Fox, G., Gannon, D., Goble, C., Livny, M., Moreau, L., and Myers, J. 2007. Examining the challenges of scientific workflows. IEEE Comput. 40, 2, 24--32. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Herbst, J. and Karagiannis, D. 1998. Integrating machine learning and workflow management to support acquisition and adaptation of workflow models. In Proceedings of the International Conference on Database and Expert Systems Applications (DEXA). IEEE, Los Alamitos, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Hogg, C., Muñoz-Avila, H., and Kuter, U. 2008. HTN-MAKER: Learning HTNs with minimal additional knowledge engineering required. In Proceedings of the Conference on Artificial Intelligence (AAAI). AAAI Press, Menlo Park, CA, 950--956. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Ilghami, O., Nau, D. S., and Muñoz-Avila, H. 2002. CaMeL: Learning method preconditions for HTN planning. In Proceedings of the International Conference on AI Planning and Scheduling (AIPS). AAAI Press, Menlo Park, CA, 131--141.Google ScholarGoogle Scholar
  18. Kindler, E., Rubin, V., and Schäfer, W. 2006. Process mining and petri net synthesis. In Business Process Management Workshops. Lecture Notes in Computer Science, vol. 4103. Springer, 105--116. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Lau, T. 2001. Programming by demonstration: A machine learning approach. Ph.D. thesis, University of Washington, Seattle, WA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Leake, D. B. and Kendall-Morwick, J. 2008. Towards case-based support for e-science workflow generation by mining provenance. In Proceedings of the European Conference on Case Based Reasoning (ECCBR). Lecture Notes in Computer Science, vol. 5239, Springer, 269--283. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Li, N., Kambhampati, S., and Yoon, S. 2009. Learning probabilistic hierarchical task networks to capture user preferences. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). Morgan Kaufmann, 1754--1759. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Lu, S., Deelman, E., and Zhao, Z., Eds. 2010. Int. J. Bus. Process Integr. Manag. (Special Issue on Scientific Workflows), 5, 1.Google ScholarGoogle Scholar
  23. Martin, D., Burstein, M., McDermott, D., McIlraith, S., Paolucci, M., Sycara, K., McGuinness, D., Sirin, E., and Srinivasan, N. 2007. Bringing semantics to Web services with OWL-S. World Wide Web 10, 3, 243--277. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Martín, M. and Geffner, H. 2004. Learning generalized policies from planning examples using concept languages. Appl. Intell. 20, 1, 9--19. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Microsoft. 2010. Microsoft Office sharePoint designer. http://office.microsoft.com/en-us/sharepointdesigner/HA101005911033.aspx.Google ScholarGoogle Scholar
  26. Minton, S. 1994. Machine Learning Methods for Planning. Morgan Kaufmann, San Mateo, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Minton, S., Carbonell, J. G., Knoblock, C. A., Kuokka, D. R., Etzioni, O., and Gil, Y. 1990. Explanation-Based learning: A problem solving perspective. In Machine Learning: Paradigms and Methods. Elsevier/North Holland, New York, 63--118. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Nejati, N., Langley, P., and Konik, T. 2006. Learning Hierarchical Task Networks by observation. In Proceedings of the International Conference on Machine Learning (ICML). ACM Press, New York, NY, 665--672. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Santos, E., Koop, D., Vo, H. T., Anderson, E. W., Freire, J., and Silva, C. 2009. Using workflow medleys to streamline exploratory tasks. In Proceedings of the International Conference on Scientific and Statistical Database Management (SSDBM). Springer, 292--30l. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Shen, J., Fitzhenry, E., and Dietterich, T. G. 2009. Discovering frequent work procedures from resource connections. In Proceedings of the International Conference on Intelligent User Interfaces (IUI). ACM Press, New York, NY, 277--286. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Silva, R., Zhang, J., and Shanahan, J. G. 2005. Probabilistic workflow mining. In Proceedings of the ACM International Conference on Knowledge Discovery in Data Mining (KDD). ACM Press, New York, NY, 275--284. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. van der Aalst, W., Weijters, T., and Maruster, L. 2004. Workflow mining: Discovering process models from event logs. IEEE Trans. Knowl. Data Engin. 16, 9, 1128--1142. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. van der Aalst, W. M. P., Weijters, A. J. M. M., and Maruster, L. 2002. Workflow mining: Which processes can be rediscovered? Tech. rep. BETA Working Paper Series, WP 74, Eindhoven University of Technology, Eindhoven, Netherlands.Google ScholarGoogle Scholar
  34. van Dongen, B. F., de Medeiros, A. K. A., Verbeek, H. M. W., Weijters, A. J. M. M., and van der Aalst, W. M. P. 2005. The ProM framework: A new era in process mining tool support. In Proceedings of the International Conference on Application and Theory of Petri Nets (PETRI NETS). G. Ciardo and P. Darondeau Eds. Lecture Notes in Computer Science, vol. 3536. Springer, 444--454. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Winner, E. 2008. Learning domain-specific planners from example plans. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Yaman, F., Oates, T., and Burstein, M. H. 2009. A context driven approach for workflow mining. In IJCAI Workshop on Learning Structural Knowledge From Observations. AAAI Press, Menlo Park, CA, 1798--1803. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Yoon, S., Fern, A., and Givan, R. 2005. Learning measures of progress for planning domains. In Proceedings of the Conference on Artificial Intelligence (AAAI). AAAI Press, Menlo Park, CA, 1217--1222. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Yoon, S., Fern, A., and Givan, R. 2008. Learning control knowledge for forward search planning. J. Mach. Learn. Res. 9, 683--718. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Zimmerman, T. and Kambhampati, S. 2003. Learning-Assisted automated planning: Looking back, taking stock, going forward. AI Mag. 24, 2, 73--96. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Zinn, D., Bowers, S., McPhillips, T., and Ludäscher, B. 2009. Scientific workflow design with data assembly lines. In Proceedings of the Workshop on Workflows in Support of Large-Scale Science (WORKS). ACM Press, New York, NY, 1--10. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. RECYCLE: Learning looping workflows from annotated traces

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM Transactions on Intelligent Systems and Technology
            ACM Transactions on Intelligent Systems and Technology  Volume 2, Issue 4
            July 2011
            272 pages
            ISSN:2157-6904
            EISSN:2157-6912
            DOI:10.1145/1989734
            Issue’s Table of Contents

            Copyright © 2011 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 15 July 2011
            • Accepted: 1 March 2011
            • Revised: 1 February 2011
            • Received: 1 December 2010
            Published in tist Volume 2, Issue 4

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Research
            • Refereed

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader