Traditional Learning Management Systems are installed on a single server where learning materials and user data are kept. To increase its performance, the Learning Management System can be installed on multiple servers; learning materials and user data could be distributed across these servers obtaining a Distributed Learning Management System. In this paper is proposed the prototype of a recommendation system based on association rules for Distributed Learning Management System. Information from LMS databases is analyzed using distributed data mining algorithms in order to extract the association rules. Then the extracted rules are used as inference rules to provide personalized recommendations. The quality of provided recommendations is improved because the rules used to make the inferences are more accurate, since these rules aggregate knowledge from all e-Learning systems included in Distributed Learning Management System.
1. Gabroveanu, M., Diaconescu, I. M., Extracting Semantic Annotations from Moodle Data, Proceedings of the 2nd East European Workshop on Rule-Based Applications (RuleApps 2008) at the 18th European Conference on Artificial Intelligence (ECAI 2008), pp. 1-5, Patras, Greece, (2008).
2. Agrawal, R., Imielinski, T., Swami, A. N., Mining association rules between sets of items in large databases, Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Buneman, P., Jajodia, S. eds., ACM Press, pp. 207-216, Washington, D.C., May 26-28, (1993).
3. Tan, P.-N., Steinbach, M., Kumar, V., Introduction to Data Mining, Addison-Wesley, ISBN 0321321367, (2005).
4. Agrawal, R., Srikant, R., Fast algorithms for mining association rules, Proceedings of the 20th International Conference Very Large Data Bases, (VLDB), Morgan Kaufmann, pp. 487-499, (1994).
5. Park, J. S., Chen, M. S., Yu, P. S., An effective hash-based algorithm for mining association rules, Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, (SIGMOD '95), pp. 175-186, San Jose, Canada, (1995).
6. Savasere, A., Omiecinski, E., Navathe, S. B., An efficient algorithm for mining association rules in large databases, Proceedings of 21th International Conference on Very Large Data Bases (VLDB’95), Dayal, U. Gray, P. M. D., Nishio, S. eds., Morgan Kaufmann, pp. 432-444, (1995).
7. Brin, S., Motwani, R., Ullman, J. D., Tsur, S., Dynamic itemset counting and implication rules for market basket data, Proceedings ACM SIGMOD International Conference on Management of Data, ACM Press, pp. 255-264, (1997).
8. Agrawal, R., Shafer, J. C., Parallel mining of association rules, IEEE Transactions on Knowledge And Data Engineering, vol. 8, pp. 962–969, (1996).
9. Cheung, D. W., Han, J., Ng, V. T., Fu, A. W., Fu, Y., A fast distributed algorithm for mining association rules, Proceedings of the 4th International Conference on Parallel and Distributed Information Systems (PDIS ’96), IEEE Computer Society Technical Committee on Data Engineering, and ACM SIGMOD, pp. 31–43, (1996).
10. Li, L., Zhang, M., The strategy of mining association rule based on cloud computing, Proceedings of the International Conference on Business Computing and Global Informatization, (BCGIN ’11), IEEE Computer Society, pp. 475–478, Shanghai, (2011).
11. Lin, J., Dyer, C., Data-Intensive Text Processing with MapReduce, Morgan and Claypool Publishers, (2010).
12. Lin, M. Y., Lee, P. Y., Hsueh, S. C., Apriori-based frequent itemset mining algorithms on MapReduce, Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication (ICUIMC '12), ACM, pp. 76:1–76:8, New York, NY, USA (2012).
13. Han, J., Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, (2005).
14. Garcia, E., Romero, C., Ventura, S., Calders, T., Drawbacks and solutions of applying association rule mining in learning management systems, Proceedings of the International Workshop on Applying Data Mining in e-Learning (ADML’07), pp. 13-22, Crete, Greece, (2007).