Skip to main content

Trace Clustering Based on Activity Profile for Process Discovery in Education

  • Conference paper
  • First Online:
Intelligent Systems Design and Applications (ISDA 2022)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 716))

  • 363 Accesses

Abstract

The basic objective of process mining is to discover, monitor, and improve process models by extracting knowledge from event logs using different techniques. In order to enhance the quality of process models, several works in literature used trace clustering, where a trace represents a sequence of events of the same process instance (user). In this research paper, we attempt to discover process models in the educational domain so as to refine learning resource recommendation. For this reason, we propose to apply trace clustering on event log extracted from the learning platform Moodle. Indeed, to the best of our knowledge, trace clustering has not yet been applied in the educational domain. From this perspective, we performed several experiments with various clustering algorithms to retain the most performant one. Subsequently, we applied a process discovery algorithm, namely heuristic miner. The results revealed that the quality of the discovered process models is better once trace clustering is considered.

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 219.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.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

Similar content being viewed by others

Notes

  1. 1.

    “User Guide.” Gaussian mixture models. Web. ©2007 - 2022. scikit-learn developers.

References

  1. Van Der Aalst, W.: Process mining: overview and opportunities. ACM Trans. Manage. Inf. Syst. (TMIS) 3(2), 1–17 (2012)

    Article  Google Scholar 

  2. Bey, A., Champagnat, R.: Analyzing student programming paths using clustering and process mining. In: Cukurova, M., Rummel, N., Gillet, D., McLaren, B.M., Uhomoibhi, J. (eds.) Proceedings of the 14th International Conference on Computer Supported Education, CSEDU 2022, Online Streaming, April 22-24, 2022, Volume 2, pp. 76–84. SCITEPRESS (2022)

    Google Scholar 

  3. Leblay, J., Rabah, M., Champagnat, R., Nowakowski, S.: Process-based assistance method for learner academic achievement. In: International Association for Development of the Information Society (2018)

    Google Scholar 

  4. Zayani, C.A., Ghorbel, L., Amous, I., Mezghanni, M., Péninou, A., Sèdes, F.: Profile reliability to improve recommendation in social-learning context. Online Inf. Rev. 44(2), 433–454 (2018)

    Article  Google Scholar 

  5. Troudi, A., Ghorbel, L., Amel Zayani, C., Jamoussi, S., Amous, I.: Mder: multi-dimensional event recommendation in social media context. Comput. J. 64(3), 369–382 (2021)

    Article  Google Scholar 

  6. Hachicha, W., Ghorbel, L., Champagnat, R., Zayani, C.A., Amous, I.: Using process mining for learning resource recommendation: a moodle case study. Procedia Comput. Sci. 192, 853–862 (2021)

    Article  Google Scholar 

  7. Hachicha, W., Champagnat, R., Ghorbel, L., Zayani, C.A.: Process models enhancement with trace clustering. In: Proceedings of the 30th International Conference on Computers in Education. Asia-Pacific Society for Computers in Education (2022)

    Google Scholar 

  8. Bose, R.J.C., Van der Aalst, W.M.: Context aware trace clustering: towards improving process mining results. In: Proceedings of the 2009 SIAM International Conference on Data Mining, pp. 401–412 (2009)

    Google Scholar 

  9. Di Francescomarino, C., Dumas, M., Maggi, F.M., Teinemaa, I.: Clustering-based predictive process monitoring. IEEE Trans. Serv. Comput. 12(6), 896–909 (2016)

    Article  Google Scholar 

  10. Faizan, M., Zuhairi, M.F., Ismail, S.: Process discovery enhancement with trace clustering and profiling. Ann. Emerging Technol. Comput. (AETiC) 5(4), 1–13 (2021)

    Article  Google Scholar 

  11. Song, M., Günther, C.W., van der Aalst, W.M.P.: Trace clustering in process mining. In: Ardagna, D., Mecella, M., Yang, J. (eds.) BPM 2008. LNBIP, vol. 17, pp. 109–120. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00328-8_11

    Chapter  Google Scholar 

  12. Xu, J., Liu, J.: A profile clustering based event logs repairing approach for process mining. IEEE Access 7, 17872–17881 (2019)

    Article  Google Scholar 

  13. Ceravolo, P., Damiani, E., Torabi, M., Barbon, S.: Toward a new generation of log pre-processing methods for process mining. In: Carmona, J., Engels, G., Kumar, A. (eds.) BPM 2017. LNBIP, vol. 297, pp. 55–70. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-65015-9_4

    Chapter  Google Scholar 

  14. Van Der Aalst, W.: Process Mining: Data Science in Action, pp. 1–477. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-49851-4

  15. Buijs, J.C.A.M., van Dongen, B.F., van der Aalst, W.M.P.: On the role of fitness, precision, generalization and simplicity in process discovery. In: Meersman, R., et al. (eds.) OTM 2012. LNCS, vol. 7565, pp. 305–322. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33606-5_19

    Chapter  Google Scholar 

  16. De Weerdt, J., Vanden Broucke, S., Vanthienen, J., Baesens, B.: Active trace clustering for improved process discovery. IEEE Trans. Knowl. Data Eng. 25(12), 2708–2720 (2013)

    Article  Google Scholar 

  17. Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, vol. 96, pp. 226–231 (1996)

    Google Scholar 

  18. Müllner, D.: Modern hierarchical, agglomerative clustering algorithms. arXiv preprint arXiv:1109.2378 (2011)

  19. McCool, M., Robison, A.D., Reinders, J.: Chapter 11 - k-means clustering. In: McCool, M., Robison, A.D., Reinders, J. (eds.) Structured Parallel Programming, pp. 279–289. Morgan Kaufmann, Boston (2012)

    Chapter  Google Scholar 

  20. Trabelsi, M., Suire, C., Morcos, J., Champagnat, R.: A new methodology to bring out typical users interactions in digital libraries. In: 2021 ACM/IEEE Joint Conference on Digital Libraries (JCDL), pp. 11–20 (2021). IEEE

    Google Scholar 

Download references

Acknowledgment

This work was financially supported by the PHC Utique program of the French Ministry of Foreign Affairs and Ministry of higher education and research and the Tunisian Ministry of higher education and scientific research in the CMCU project number 22G1403.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wiem Hachicha .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hachicha, W., Ghorbel, L., Champagnat, R., Zayani, C.A. (2023). Trace Clustering Based on Activity Profile for Process Discovery in Education. In: Abraham, A., Pllana, S., Casalino, G., Ma, K., Bajaj, A. (eds) Intelligent Systems Design and Applications. ISDA 2022. Lecture Notes in Networks and Systems, vol 716. Springer, Cham. https://doi.org/10.1007/978-3-031-35501-1_54

Download citation

Publish with us

Policies and ethics

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy