International Journal of Intelligent Systems and Applications (IJISA)
IJISA Vol. 13, No. 2, 8 Apr. 2021
Cover page and Table of Contents: PDF (size: 755KB)
Collaborative E-Learning Process Discovery in Multi-tenant Cloud
Full Text (PDF, 755KB), PP.21-37
Views: 0 Downloads: 0
Author(s)
Sameh. Azouzi
1,2,*
Jalel eddine. Hajlaoui
3
Zaki. Brahmi
2
Sonia. Ayachi Ghannouchi
2,4
Index Terms
LPaaS, BPaaS E-learning process, Discovery, QoS, Cloud Computing, Recommender System
Abstract
With the appearance of the COVID-19 pandemic, the practice of e-learning in the cloud makes it possible to: avoid the problem of overloading the institutions infrastructure resources, manage a large number of learners and improve collaboration and synchronous learning. In this paper, we propose a new e-leaning process management approach in cloud named CLP-in-Cloud (for Collaborative Learning Process in Cloud). CLP-in-Cloud is composed of two steps: i) design general, configurable and multi-tenant e-Learning Process as a Service (LPaaS) that meets different needs of institutions. ii) to fulfill the user needs, developpe a functional and non-functional awareness LPaaS discovery module. For functional needs, we adopt the algorithm A* and for non-functional needs we adopt a linear programming algorithm. Our developed system allows learners to discover and search their preferred configurable learning process in a multi-tenancy Cloud architecture. In order to help to discover interesting process, we come up with a recommendation module. Experimentations proved that our system is effective in reducing the execution time and in finding appropriate results for the user request.
Cite This Paper
Sameh. Azouzi, Jalel eddine. Hajlaoui, Zaki. Brahmi, Sonia. Ayachi Ghannouchi, "Collaborative E-Learning Process Discovery in Multi-tenant Cloud", International Journal of Intelligent Systems and Applications(IJISA), Vol.13, No.2, pp.21-37, 2021. DOI:10.5815/ijisa.2021.02.02
Reference
[1] Sana Khan, and Sheikh Tahir Bakhsh, “A study on the role of Facebook in e-learning,” International Journal of Education and Management Engineering, Vol. 5, No. 5 pp. 1-11,2015.
[2] Maria Dominic, and Sagayaraj Francis, “An adaptable e-learning architecture based on learners’ profiling,” International Journal of Modern Education and Computer Science, Vol. 7, No. 3, pp. 26-32, 2015.
[3] Tinankoria Diaby, Babak Bashari Rad,"Cloud Computing: A review of the Concepts and Deployment Models", International Journal of Information Technology and Computer Science, Vol.9, No.6, pp.50-58, 2017.
[4] Md. Iram Alam, Manjusha Pandey and Pandey, Siddharth S Rautaray, “A comprehensive survey on cloud computing,” International Journal of Information Technology and Computer Science, Vol. 2, No. 2, pp. 68-79, 2015.
[5] R. Dijkman, M. Dumas, L. García-Bañuelos, and R. Käärik, “Aligning business process models,” in IEEE International Enterprise Distributed Object Computing Conference, 2009, pp. 45--53.
[6] J. Ling, L. Zhang, and Q. Feng, “Business process model alignment: An approach to support fast discovering complex matches,” in Enterprise Interoperability VI, Springer, 2014, pp. 41--51.
[7] S. Azouzi, J. Hajlaoui, S. A. Ghannouchi, and Z. Brahmi, “E-Learning BPaaS Discovery in Cloud Based on a Structural Matching,” in Advancing Technology Industrialization Through Intelligent Software Methodologies, Tools and Techniques, 2019, pp. 176–189.
[8] A. Gater, F. Lemos, D. Grigori, and M. Bouzeghoub, “S-Discovery: A behavioral and quality-based Service Discovery on the cloud,” in International Conference on Cloud Computing and Services Science, 2013, pp. 104–109.
[9] A. Gater, D. Grigori, and M. Bouzeghoub, “Indexing process model flow dependencies for similarity search,” in International Conferences on n the Move to Meaningful Internet Systems, 2012, pp. 128–145.
[10] J. Gao and L. Zhang, “On measuring semantic similarity of business process models,” in International Conference on Interoperability for Enterprise Software and Applications, 2009, pp. 289–293.
[11] C. Klinkmüller, I. Weber, J. Mendling, H. Leopold, and A. Ludwig, “Increasing recall of process model matching by improved activity label matching,” in Business process management, 2013, pp. 211–218.
[12] S. Azouzi, S. A. Ghannouchi, and Z. Brahmi, “Software product line to express variability in e-learning process,” in International Conference on Digital Economy, 2017, pp. 95--104.
[13] L. S. Vygotsky, M.Cole, V. John-Steiner, S. Schribner, and E. and E. Souberman, Mind in Society: The Development of Higher Psychological Processes. Cambridge, 1978.
[14] J.-P. Pernin, “Objets pédagogiques: unités d’apprentissage, activités ou ressources,” Rev. Sci. Tech. Educ. Hors série, pp. 179--210, 2003.
[15] R. Dijkman, M. Dumas, and L. García-Bañuelos, “Graph matching algorithms for business process model similarity search,” in International Conference on Business Process Management, 2009, pp. 48--63.
[16] H. A. Almohamad and S. O. Duffuaa, “A Linear Programming Approach for the Weighted Graph Matching Problem,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 15, no. 5, pp. 522–525, 1993.
[17] P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl, “GroupLens: An open architecture for collaborative filtering of netnews,” in ACM conference on Computer supported cooperative work, 1994, pp. 175–186.
[18] R. Dijkman, M. Dumas, B. Van Dongen, R. Krik, and J. Mendling, “Similarity of business process models: Metrics and evaluation,” Inf. Syst., vol. 36, no. 2, pp. 498–516, 2011.
[19] C. Klinkmüller, H. Leopold, I. Weber, J. Mendling, and A. Ludwig, “Listen to me: Improving process model matching through user feedback,” in International Conference on Business Process Management, Springer, 2014, pp. 84–100.
[20] E. Kuss, H. Leopold, H. van der Aa, H. Stuckenschmidt, and H. A. Reijers, “A probabilistic evaluation procedure for process model matching techniques,” in Data and Knowledge Engineering, 2018, pp. 279–292.
[21] A. Awad and S. Sakr, “Querying graph-based repositories of business process models,” in International Conference on Database Systems for Advanced Applications, 2010, pp. 33–44.
[22] Z. Yan, R. Dijkman, and P. Grefen, “Fast business process similarity search with feature-based similarity estimation,” in International Conferences" On the Move to Meaningful Internet Systems, 2010, pp. 60–77.
[23] M. Ehrig, A. Koschmider, and A. Oberweis, “Measuring similarity between semantic business process models,” in the fourth Asia-Pacific conference on Comceptual modelling,Vol. 67, 2007, pp. 71–80.
[24] S. Ben Mokhtar, D. Preuveneers, N. Georgantas, V. Issarny, and Y. Berbers, “EASY: Efficient semAntic Service discoverY in pervasive computing environments with QoS and context support,” J. Syst. Softw., vol. 81, no. 5, pp. 785–808, 2008.
[25] S. Agarwal, S. Lamparter, and R. Studer, “Making Web services tradable. A policy-based approach for specifying preferences on Web service properties,” J. Web Semant., vol. 7, no. 1, pp. 11–20, 2009.
[26] F. Jabeen, H. Leopold, and H. A. Reijers, “How to make process model matching work better? An analysis of current similarity measures,” in International Conference on Business Information Systems, 2017, pp. 181–193.
[27] N. Assy, B. F. Van Dongen, and W. M. P. Van Der Aalst, “Similarity resonance for improving process model matching accuracy,” in Proceedings of the ACM Symposium on Applied Computing, 2018.
[28] J. K. Tarus, Z. Niu, and A. Yousif, “A hybrid knowledge-based recommender system for e-learning based on ontology and sequential pattern mining,” Futur. Gener. Comput. Syst., 2017.
[29] J. Tarus, Z. Niu, and B. Khadidja, “E-Learning Recommender System Based on Collaborative Filtering and Ontology,” Int. J. Comput. Inf. Eng., vol. 11, no. 2, pp. 256–261, 2017.
[30] N. Joshi and R. Gupta, “An E-Learning based Recommendation System for Semantic Web: A Survey,” Int. J. Comput. Sci. Eng., 2019.
[31] A. Karatzoglou and B. Hidasi, “Deep learning for recommender systems,” in RecSys 2017 - Proceedings of the 11th ACM Conference on Recommender Systems, 2017.
[32] G. George and A. M. Lal, “Review of ontology-based recommender systems in e-learning,” Comput. Educ., 2019.
[33] J. Mawanel, A. Naji, and M. Ramdani, “Clustering collaborative filtering approach for Diftari E-Learning platform’ recommendation system.,” in ACM International Conference Proceeding Series, 2018.
[34] F. Lemos, D. Grigori, and M. Bouzeghoub, “Adding non-functional preferences to service discovery,” in International Conference on Web Engineering, 2012, pp. 299–306.
[35] N. Manouselis, H. Drachsler, R. Vuorikari, H. Hummel, and R. Koper, “Recommender Systems in Technology Enhanced Learning,” in Recommender Systems Handbook, 2011.
[36] G. Adomavicius and A. Tuzhilin, “Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions,” IEEE Transactions on Knowledge and Data Engineering. 2005.
[37] L. Baltrunas, T. Makcinskas, and F. Ricci, “Group recommendations with rank aggregation and collaborative filtering,” in RecSys’10 - Proceedings of the 4th ACM Conference on Recommender Systems, 2010.
[38] V. Levenshtein, “Binary codes capable of correcting deletions, insertions, and reversals,” in Soviet Physics Doklady, 4th ed., 1966, pp. 707--710.
[39] K. Riesen, S. Emmenegger, and H. Bunke, “A novel software toolkit for graph edit distance computation,” in International Workshop on Graph-Based Representations in Pattern Recognition, 2013, pp. 142--151.
[40] D. Conte, P. Foggia, C. Sansone, and M. Vento, “Thirty years of graph matching in pattern recognition,” Int. J. Pattern Recognit. Artif. Intell., vol. 18, no. 03, pp. 265--298, 2004.
[41] S. Sorlin and C. Solnon, “Reactive Tabu search for measuring graph similarity,” in International Workshop on Graph-Based Representations in Pattern Recognition, 2005, pp. 172--182.
[42] M. Neuhaus, K. Riesen, and H. Bunke, “Fast suboptimal algorithms for the computation of graph edit distance,” in International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition, 2006, pp. 163–172.
[43] R. Boughamoura, M. N. Omri, and H. Youssef, “Fuzzy Approach to Extract Pertinent Information from Web Resources,” in The International Group of E-Research Systems and Applications, 2007.
[44] H. A. Almohamad, “A polynomial transform for matching pairs of weighted graphs,” Appl. Math. Model., vol. 15, no. 4, pp. 216–222, 1991.
[45] J. E. Hajlaoui, M. N. Omri, and D. Benslimane, “A QoS-aware approach for discovering and selecting configurable IaaS Cloud services,” Comput. Syst. Sci. Eng., 2017.
[46] U. Shardanand and P. Maes, “Social information filtering: algorithms for automating ‘word of mouth,’” in Conference on Human Factors in Computing Systems - Proceedings, 1995.
[47] V. Mark, “Modeling Business Process Variability,” Diss. University of Twente, 2007.
[48] X. Zheng, P. Martin, K. Brohman, and M. Zhang, “Cloud service negotiation: A research report,” Int. J. Bus. Process Integr. Manag., vol. 7, no. 2, pp. 103–113, 2014.
[49] G. Guo, J. Zhang, and N. Yorke-Smith, “A novel bayesian similarity measure for recommender systems,” in IJCAI International Joint Conference on Artificial Intelligence, 2013.
[50] K. Riesen and H. Bunke, “Approximate graph edit distance computation by means of bipartite graph matching,” Image Vis. Comput., 2009.
[51] N. Thai-Nghe, L. Drumond, A. Krohn-Grimberghe, and L. Schmidt-Thieme, “Recommender system for predicting student performance,” in Procedia Computer Science, 2010.
[52] L. Makni, N. Z. Haddar, and H. Ben-Abdallah, “Business process model matching: An approach based on semantics and structure,” in International Conference on e-Business and Telecommunications, 2015, pp. 64–71.
[53] S. Umeyama, “An Eigendecomposition Approach to Weighted Graph Matching Problems,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 10, no. 5, pp. 695--703, 1988.