Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Representing and Visualizing Mined Artful Processes in MailOfMine

  • Conference paper
Information Quality in e-Health (USAB 2011)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7058))

Included in the following conference series:

  • 2378 Accesses

Abstract

Artful processes are informal processes typically carried out by those people whose work is mental rather than physical (managers, professors, researchers, engineers, etc.), the so called “knowledge workers”. mailofmine is a tool, the aim of which is to automatically build, on top of a collection of e-mail messages, a set of workflow models that represent the artful processes laying behind the knowledge workers activities. This paper presents its innovative graphical syntax proposal and the interface for representing and showing such mined processes to users.

This work has been partly supported by Sapienza – Università di Roma through the grants FARI 2010 and TESTMED, and by the EU Commission through the FP7 project Smart Vortex. The authors would like also to thank Monica Scannapieco and Diego Zardetto for useful insights and discussions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Shaman. FP7 IP Project, http://shaman-ip.eu/shaman/

  2. Smart Vortex. FP7 IP Project, http://www.smartvortex.eu/

  3. van der Aalst, W.M.P.: Verification of Workflow Nets. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 407–426. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  4. van der Aalst, W.M.P.: The application of petri nets to workflow management. Journal of Circuits, Systems, and Computers 8(1), 21–66 (1998)

    Article  Google Scholar 

  5. van der Aalst, W.M.P., van Dongen, B.F., Günther, C.W., Rozinat, A., Verbeek, E., Weijters, T.: ProM: The process mining toolkit. In: BPM 2009 Demos (2009)

    Google Scholar 

  6. van der Aalst, W.M.P., Pesic, M.: Decserflow: Towards a Truly Declarative Service Flow Language. In: Bravetti, M., Núñez, M., Tennenholtz, M. (eds.) WS-FM 2006. LNCS, vol. 4184, pp. 1–23. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. van der Aalst, W.M.P., Pesic, M., Schonenberg, H.: Declarative workflows: Balancing between flexibility and support. Computer Science - R&D 23(2) (2009)

    Google Scholar 

  8. de Carvalho, V.R., Cohen, W.W.: Learning to extract signature and reply lines from email. In: CEAS (2004)

    Google Scholar 

  9. Catarci, T., Dix, A., Katifori, A., Lepouras, G., Poggi, A.: Task-Centred Information Management. In: Thanos, C., Borri, F., Candela, L. (eds.) Digital Libraries: R & Development. LNCS, vol. 4877, pp. 197–206. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Chomsky, N., Miller, G.A.: Finite state languages. Information and Control 1(2), 91–112 (1958)

    Article  MathSciNet  MATH  Google Scholar 

  11. Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press (2001)

    Google Scholar 

  12. Di Ciccio, C., Mecella, M., Scannapieco, M., Zardetto, D., Catarci, T.: MailOfMine – Analyzing mail messages for mining artful collaborative processes. In: SIMPDA (2011)

    Google Scholar 

  13. Garofalakis, M.N., Rastogi, R., Shim, K.: Spirit: Sequential pattern mining with regular expression constraints. In: VLDB (1999)

    Google Scholar 

  14. Heutelbeck, D.: Preservation of enterprise engineering processes by social collaboration software. Personal Communication (2011)

    Google Scholar 

  15. ter Hofstede, A.M., van der Aalst, W.M.P., Adams, M., Russell, N.: Modern Business Process Automation: YAWL and its Support Environment. Springer, Heidelberg (2010)

    Book  Google Scholar 

  16. Pesic, M., van der Aalst, W.M.P.: A Declarative Approach for Flexible Business Processes Management. In: Eder, J., Dustdar, S. (eds.) BPM Workshops 2006. LNCS, vol. 4103, pp. 169–180. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3, 114–125 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  18. Warren, P., Kings, N., et al.: Improving knowledge worker productivity - The ACTIVE integrated approach. BT Technology Journal 26(2), 165–176 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Di Ciccio, C., Mecella, M., Catarci, T. (2011). Representing and Visualizing Mined Artful Processes in MailOfMine. In: Holzinger, A., Simonic, KM. (eds) Information Quality in e-Health. USAB 2011. Lecture Notes in Computer Science, vol 7058. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25364-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25364-5_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25363-8

  • Online ISBN: 978-3-642-25364-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics