Analysis of computer science related curriculum on LDA and Isomap

  • Authors:
  • Takayuki Sekiya;Yoshitatsu Matsuda;Kazunori Yamaguchi

  • Affiliations:
  • Information Technology Center, the University of Tokyo, 3-8-1 Komaba, Meguro, Tokyo, Japan;Department of Integrated Information Technology, Aoyama Gakuin University, 5-10-1 Fuchinobe, Sagamihara, , Japan;Information Technology Center, the University of Tokyo, 3-8-1 Komaba, Meguro, Tokyo, Japan

  • Venue:
  • Proceedings of the fifteenth annual conference on Innovation and technology in computer science education
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

A good curriculum is crucial for a successful university education. When developing a curriculum, topics, such as natural science, informatics, and so on are set first, course syllabi are written accordingly. However, the topics actually by the courses are not guaranteed to be identical to the initially set topics. To find out if the actual topics are covered by the developed course syllabi, we developed a method of systematically analyzing syllabi that uses latent Dirichlet allocation (LDA) and Isomap. We applied this method to the syllabi of MIT and those of the Open University, and verified that the method is effective.