Advertisement

Assisting Business Process Design by Activity Neighborhood Context Matching

  • Nguyen Ngoc Chan
  • Walid Gaaloul
  • Samir Tata
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7636)

Abstract

Speeding up the business process design phase is a crucial challenge in recent years. Some solutions, such as defining and using reference process models or searching similar processes to a working one, can facilitate the designer’s work. However, recommending the whole process can make the designer confused, especially in case of large-size business processes. In this paper, we introduce the concept of activity neighborhood context in order to propose an approach that fasten the design phase regardless the size of business process. Concretely, we recommend the designer the activities that are close to the designing process from existing business processes. We evaluate our approach on a large collection of public business processes. Experimental results show that our approach is feasible and efficient.

Keywords

Business Process Recommended Activity Neighborhood Context Business Process Model Levenshtein Distance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Yan, Z., Dijkman, R., Grefen, P.: Fast Business Process Similarity Search with Feature-Based Similarity Estimation. In: Meersman, R., Dillon, T.S., Herrero, P. (eds.) OTM 2010, Part I. LNCS, vol. 6426, pp. 60–77. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  2. 2.
    van der Aalst, W.M.P., Alves de Medeiros, A.K., Weijters, A.J.M.M.: Process Equivalence: Comparing Two Process Models Based on Observed Behavior. In: Dustdar, S., Fiadeiro, J.L., Sheth, A.P. (eds.) BPM 2006. LNCS, vol. 4102, pp. 129–144. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Li, C., Reichert, M., Wombacher, A.: On Measuring Process Model Similarity Based on High-Level Change Operations. In: Li, Q., Spaccapietra, S., Yu, E., Olivé, A. (eds.) ER 2008. LNCS, vol. 5231, pp. 248–264. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Dijkman, R., Dumas, M., García-Bañuelos, L.: Graph Matching Algorithms for Business Process Model Similarity Search. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 48–63. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  5. 5.
    Ehrig, M., Koschmider, A., Oberweis, A.: Measuring similarity between semantic business process models. In: APCCM 2007, pp. 71–80 (2007)Google Scholar
  6. 6.
    Dijkman, R., Dumas, M., van Dongen, B., Käärik, R., Mendling, J.: Similarity of business process models: Metrics and evaluation. Inf. Syst. 36(2), 498–516 (2011)CrossRefGoogle Scholar
  7. 7.
    Weidlich, M., Dijkman, R., Mendling, J.: The ICoP Framework: Identification of Correspondences between Process Models. In: Pernici, B. (ed.) CAiSE 2010. LNCS, vol. 6051, pp. 483–498. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  8. 8.
    Sakr, S., Pascalau, E., Awad, A., Weske, M.: Partial process models to manage business process variants. IJBPIM 6(2), 20 (2011)Google Scholar
  9. 9.
    Lincoln, M., Gal, A.: Searching Business Process Repositories Using Operational Similarity. In: Meersman, R., Dillon, T., Herrero, P., Kumar, A., Reichert, M., Qing, L., Ooi, B.-C., Damiani, E., Schmidt, D.C., White, J., Hauswirth, M., Hitzler, P., Mohania, M. (eds.) OTM 2011, Part I. LNCS, vol. 7044, pp. 2–19. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  10. 10.
    Levenshtein, V.I.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady 10, 707 (1966)MathSciNetGoogle Scholar
  11. 11.
    Fahland, D., Favre, C., Jobstmann, B., Koehler, J., Lohmann, N., Völzer, H., Wolf, K.: Instantaneous Soundness Checking of Industrial Business Process Models. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 278–293. Springer, Heidelberg (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Nguyen Ngoc Chan
    • 1
  • Walid Gaaloul
    • 1
  • Samir Tata
    • 1
  1. 1.Information DepartmentTELECOM SudParis, UMR 5157 CNRS SamovarFrance

Personalised recommendations