A Tree Based Approach for Concept Maps Construction in Adaptive Learning Systems

  • Niharika Gupta
  • Vipul Mayank
  • M. Geetha
  • Shwetha RaiEmail author
  • Shyam Karanth
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 950)


A concept map is a diagram that depicts suggested relationships between concepts. The relationships are marked by a relevance degree that denotes the level of correlation between any two concepts. Concept map is a graphical tool used to structure and organize knowledge. In this project, a concept map will be generated based on a real-life dataset of how questions are answered by students (correctly or incorrectly) and the weight of the concepts in the questions. Several algorithms have been proposed to automatically construct concept maps. However, all these algorithms use Apriori algorithm to discover the frequent itemsets and get the association rules. Apriori algorithm requires several database scans, and thus, it is not efficient. A tree-based approach (i.e., FP tree algorithm) adopted in this project to overcome the drawbacks of the Apriori algorithm in the construction of concept maps for adaptive learning systems.


Apriori Association rules Concept map Frequent itemset Tree based 


  1. 1.
    Romero, C., Ventura, S.: Educational data mining: a review of the state of the art. IEEE Trans. Syst. Man Cybern. Part C: Appl. Rev. 40(6), 601–618 (2010)CrossRefGoogle Scholar
  2. 2.
    Yoo, J.S., Cho, M.H.: Mining concept maps to understand university students’ learning. In: Yacef, K., Zaïane, O., Hershkovitz, A., Yudelson M., Stamper, J. (eds.) Proceedings of the 5th International Conference on Educational Data Mining, Chania, Greece, vol. 41, pp. 184–187 (2012)Google Scholar
  3. 3.
    Kavitha, R., Vijaya, A., Saraswathi, D.: An augmented prerequisite concept relation map design to improve adaptivity in e-learning. In: Proceedings of the International Conference on Pattern Recognition, Informatics and Medical Engineering, pp. 8–13. IEEE, Salem (2012)Google Scholar
  4. 4.
    Kardan, A., Imani, M.B., Ebrahim, M.A.: ACO-map: a novel adaptive learning path method. In: Proceedings of the 4th International Conference on E-Learning and E-Teaching, pp. 20–25. IEEE, Shiraz (2013)Google Scholar
  5. 5.
    Acharya, A., Sinha, D.: Construction of automated concept map of learning using hashing technique. In: Satapathy, S.C., Biswal, B.N., Udgata, S.K., Mandal, J.K. (eds.) Proceedings of the 3rd International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA) 2014. AISC, vol. 327, pp. 567–578. Springer, Cham (2015). Scholar
  6. 6.
    Acharya, A., Sinha, D.: A weighted concept map approach to generate learning guidance in science courses. In: Mandal, J.K., Satapathy, S.C., Sanyal, M.K., Sarkar, P.P., Mukhopadhyay, A. (eds.) Information Systems Design and Intelligent Applications. AISC, vol. 340, pp. 143–152. Springer, New Delhi (2015). Scholar
  7. 7.
    Acharya, A., Sinha, D.: An intelligent web-based system for diagnosing student learning problems using concept maps. J. Educ. Comput. Res. 55(3), 1–23 (2016)Google Scholar
  8. 8.
    Lee, C., Lee, G., Leu, Y.: Application of automatically constructed concept map of learning to conceptual diagnosis of e-learning. Expert Syst. Appl.: Int. J. 36(2), 1675–1684 (2009)CrossRefGoogle Scholar
  9. 9.
    Chen, S., Bai, S.: Using data mining techniques to automatically construct concept maps for adaptive learning systems. Expert Syst. Appl.: Int. J. 37(6), 4496–4503 (2010)CrossRefGoogle Scholar
  10. 10.
    Chen, S., Sue, P.: Constructing concept maps for adaptive learning systems based on data mining techniques. Expert. Syst. Appl.: Int. J. 40(7), 2746–2755 (2013)CrossRefGoogle Scholar
  11. 11.
    Al-Sarem, M., Bellafkih, M., Ramdani, M.: Mining concepts’ relationship based on numeric grades. Int. J. Comput. Sci. 8(3), 136–142 (2011)Google Scholar
  12. 12.
    Shieh, J.C., Yang, Y.T.: Concept maps construction based on student-problem chart. In: Proceedings of IIAI 3rd International Conference on Advanced Applied Informatics, pp. 324–327. IEEE, Kitakyushu (2014)Google Scholar
  13. 13.
    Agarwal, R., Srikant, R.: Fast algorithm for mining association rules. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487–499. ACM, Morgan Kaufmann Publishers Inc., San Francisco (1994)Google Scholar
  14. 14.
    Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Chen, W., Naughton, J., Bernstein, P.A. (eds.), Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 1–12. ACM, Dallas (2000)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.Department of Computer and EngineeringManipal Institute of Technology, Manipal Academy of Higher EducationManipalIndia

Personalised recommendations