Towards Enhancing Historical Analogy: Clustering Users Having Different Aspects of Events

Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 69)


Studying history can provide numerous benefits for finding meaningful connections or analogies over time. Several researchers have studied how to support promoting historical analogy by computer supported learning; however, supporting group discussions to promote the analogy still remains unexplored. In this paper, we propose a novel clustering algorithm to form users who have different aspects of the same past event in order to ease exchange ideas of what aspects they focus to analyze the event. We implemented our algorithms and evaluated them in terms of getting accuracies of forming users having different aspects. Experimental results proved that only our algorithm creates suitable groups.


Clustering Analogy Collaborative learning History education 


This work was supported by JSPS KAKENHI Grant Number 16K16314.


  1. 1.
    Aggarwal, C.C., Zhai, C.: A Survey of text clustering algorithms, pp. 77–128. Springer, Boston (2012)CrossRefGoogle Scholar
  2. 2.
    Boix-Mansilla, V.: Historical understanding: beyond the past and into the present. In: Knowing, Teaching, and Learning History: National and International Perspectives, pp. 390–418 (2000)Google Scholar
  3. 3.
    Calinski, T., Harabasz, J.: A dendrite method for cluster analysis. Commun. Stat. 3, 1–27 (1974)MathSciNetzbMATHGoogle Scholar
  4. 4.
    David, J.S.: A History of the Future, vol. 41. History and Theory, Theme Issue (2002)Google Scholar
  5. 5.
    van Drie, J., van Boxtel, C.: Historical reasoning: towards a framework for analyzing students’ reasoning about the past. Educ. Psychol. Rev. 20(2), 87–110 (2008)CrossRefGoogle Scholar
  6. 6.
    Ministry of Education, Culture, Sports, Science and Technology: Japan course of study for senior high schools (2009)Google Scholar
  7. 7.
    Fahad, A., Alshatri, N., Tari, Z., Alamri, A., Khalil, I., Zomaya, A.Y., Foufou, S., Bouras, A.: A survey of clustering algorithms for big data: taxonomy and empirical analysis. IEEE Trans. Emerg. Top. Comput. 2(3), 267–279 (2014)CrossRefGoogle Scholar
  8. 8.
    Fischer, D.H.: Historians’ Fallacies : Toward a Logic of Historical Thought. Harper & Row Publishers, New York (1970)Google Scholar
  9. 9.
    Fu, K., Mui, J.: A survey on image segmentation. Pattern Recognit. 13(1), 3–16 (1981)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large databases. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, SIGMOD 1998, pp. 73–84. ACM, New York (1998)CrossRefGoogle Scholar
  11. 11.
    Guha, S., Rastogi, R., Shim, K.: ROCK: a robust clustering algorithm for categorical attributes. In: Proceedings 15th International Conference on Data Engineering (Cat. No. 99CB36337), pp. 512–521, March 1999Google Scholar
  12. 12.
    Holyoak, K.J., Thagard, P.: Mental Leaps: Analogy in Creative Thought. MIT Press, Cambridge (1980)Google Scholar
  13. 13.
    Ikejiri, R.: Designing and evaluating the card game which fosters the ability to apply the historical causal relation to the modern problems. Japan Soc. Educ. Technol. 34(4), 375–386 (2011). (in Japanese)Google Scholar
  14. 14.
    Ikejiri, R., Sumikawa, Y.: Developing a mining system to transfer historical causations to solving modern social issues. World History Association 2016 Ghent Conference (2016)Google Scholar
  15. 15.
    Ikejiri, R., Sumikawa, Y.: Developing world history lessons to foster authentic social participation by searching for historical causation in relation to current issues dominating the news. J. Educ. Res. Soc. Stud. 84, 37–48 (2016). (in Japanese)Google Scholar
  16. 16.
    Ikejiri, R., Fujimoto, T., Tsubakimoto, M., Yamauchi, Y.: Designing and evaluating a card game to support high school students in applying their knowledge of world history to solve modern political issues. In: International Conference of Media Education. Beijing Normal University (2012)Google Scholar
  17. 17.
    Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, Hoboken (1990)CrossRefGoogle Scholar
  18. 18.
    Kaufman, L., Rousseeuw, P.J.: Partitioning Around Medoids (Program PAM), Chapter 2, pp. 68–125. Wiley-Blackwell (2008)Google Scholar
  19. 19.
    Lee, P.: Historical literacy: theory and research. Int. J. Hist. Learn. Teach. Res. 5(1), 25–40 (2005)MathSciNetGoogle Scholar
  20. 20.
    Macqueen, J.: Some methods for classification and analysis of multivariate observations. In: In 5-th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297 (1967)Google Scholar
  21. 21.
    Ng, R.T., Han, J.: CLARANS: a method for clustering objects for spatial data mining. IEEE Trans. Knowl. Data Eng. 14(5), 1003–1016 (2002). SeptCrossRefGoogle Scholar
  22. 22.
    Ogata, I., Kato, T., Kabayama, K., Kawakita, M., Kishimoto, M., Kuroda, H., Sato, T., Minamizuka, S., Yamamoto, H.: Encyclopedia of Historiography. Koubundou, Tokyo (1994)Google Scholar
  23. 23.
    Rasmussen, C.E.: The infinite Gaussian mixture model. In: Proceedings of the 12th International Conference on Neural Information Processing Systems, NIPS 1999, pp. 554–560. MIT Press, Cambridge (1999)Google Scholar
  24. 24.
    Shi, J., Malik, J.: Normalized cuts and image segmentation. Technical report (2000)Google Scholar
  25. 25.
    Sumikawa, Y., Ikejiri, R.: Mining historical social issues. In: Intelligent Decision Technologies, Smart Innovation, Systems and Technologies, vol. 39, pp. 587–597. Springer (2015)Google Scholar
  26. 26.
    Xu, D., Tian, Y.: A comprehensive survey of clustering algorithms. Ann. Data Sci. 2(2), 165–193 (2015)MathSciNetCrossRefGoogle Scholar
  27. 27.
    Xu, R., Wunschm, D.: Survey of clustering algorithms. IEEE Trans. Neural Netw. 16(3), 645–678 (2005)CrossRefGoogle Scholar
  28. 28.
    Xu, X., Ester, M., Kriegel, H.P., Sander, J.: A distribution-based clustering algorithm for mining in large spatial databases. In: Proceedings of the Fourteenth International Conference on Data Engineering, ICDE 1998, pp. 324–331. IEEE Computer Society, Washington (1998)Google Scholar
  29. 29.
    Zhang, T., Ramakrishnan, R., Livny, M.: Birch: an efficient data clustering method for very large databases. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, SIGMOD 1996, pp. 103–114. ACM, New York (1996)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Interfaculty Initiative in Information StudiesThe University of TokyoBunkyōJapan
  2. 2.Department of Information and Media StudiesNagoya Bunri UniversityInazawaJapan
  3. 3.University Education Center, Tokyo Metropolitan UniversityHachiojiJapan

Personalised recommendations