Advertisement

Using Graph Aggregation for Service Interaction Message Correlation

  • Adnene Guabtni
  • Hamid Reza Motahari-Nezhad
  • Boualem Benatallah
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6741)

Abstract

Discovering the behavior of services and their interactions in an enterprise requires the ability to correlate service interaction messages into process instances. The service interaction logic (or process model) is then discovered from the set of process instances that are the result of a given way of correlating messages. However, sometimes, the Correlation Conditions (CC) allowing to identify correlations of messages from a service interaction log are not known. In such cases, and with a large number of message’s correlator attributes, we are facing a large space of possible ways messages may be correlated which makes identifying process instances difficult. In this paper, we propose an approach based on message indexation and aggregation to generate a size-efficient Aggregated Correlation Graph (ACG) that exhibits all the ways messages correlate in a service interaction log not only for disparate pairs of messages but also for sequences of messages corresponding to process instances. Adapted filtering techniques based on user defined heuristics are then applied on such a graph to help the analysts efficiently identify the most frequently executed processes from their sequences of CCs. The approach has been implemented and experiments show its effectiveness to identify relevant sequences of CCs from large service interaction logs.

Keywords

SOA Process mining Correlation Aggregation 

References

  1. 1.
    Barros, A., Decker, G., Dumas, M., Weber, F.: Correlation patterns in service-oriented architectures. In: Proceedings of FASE Conference, pp. 245–259. Springer, Heidelberg (2007)Google Scholar
  2. 2.
    De Pauw, W., Lei, M., Pring, E., Villard, L., Arnold, M., Morar, J.F.: Web services navigator: visualizing the execution of web services. IBM Syst. J. 44, 821–845 (2005)CrossRefGoogle Scholar
  3. 3.
    Ferreira, D.R., Gillblad, D.: Discovering Process Models from Unlabelled Event Logs. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 143–158. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  4. 4.
    Motahari, H.R., Benatallah, B., Saint-Paul, R.: Protocol discovery from imperfect service interaction data. In: Proceedings of VLDB Ph.D. Workshop (2006)Google Scholar
  5. 5.
    Motahari-Nezhad, H.R., Saint-Paul, R., Benatallah, B., Casati, F.: Deriving protocol models from imperfect service conversation logs. TKDE 20, 1683–1698 (2008)Google Scholar
  6. 6.
    Măruşter, L., Weijters, A.J., Aalst, W.M., Bosch, A.: A rule-based approach for process discovery: Dealing with noise and imbalance in process logs. Data Min. Knowl. Discov. 13(1), 67–87 (2006)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Motahari Nezhad, H.R., Benatallah, B., Saint-Paul, R., Casati, F., Andritsos, P.: Peocess spaceship: Discovering process views in process spaces. Technical Report UNSW-CSE-TR-0721. The University of New South Wales, Australia (2007)Google Scholar
  8. 8.
    Nezhad, H.R.M., Benatallah, B., Saint-Paul, R., Casati, F., Andritsos, P.: Process spaceship: discovering and exploring process views from event logs in data spaces. PVLDB 1(2), 1412–1415 (2008)Google Scholar
  9. 9.
    Pauw, W.D., Hoch, R., Huang, Y.: Discovering conversations in web services using semantic correlation analysis. In: Proceedings of ICWS Conference, 639–646 (2007)Google Scholar
  10. 10.
    Spiliopoulou, M., Mobasher, B., Berendt, B., Nakagawa, M.: A framework for the evaluation of session reconstruction heuristics in web-usage analysis. Informs J. on Computing 15(2), 171–190 (2003)CrossRefzbMATHGoogle Scholar
  11. 11.
    van der Aalst, W.M.P., van Dongen, B.F., Herbst, J., Maruster, L., Schimm, G., Weijters, A.J.M.M.: Workflow mining: a survey of issues and approaches. Data Knowl. Eng. 47(2), 237–267 (2003)CrossRefGoogle Scholar
  12. 12.
    Zhang, J., Long, X., Suel, T.: Performance of compressed inverted list caching in search engines. In: Proceeding of WWW Conference, pp. 387–396. ACM, New York (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Adnene Guabtni
    • 1
    • 2
  • Hamid Reza Motahari-Nezhad
    • 3
  • Boualem Benatallah
    • 1
  1. 1.The University of New South WalesSydneyAustralia
  2. 2.National ICT Australia (NICTA)SydneyAustralia
  3. 3.HP LabsPalo AltoUSA

Personalised recommendations