T. Matsuda, M. Sonoda, Masashi Eto, H. Satoh, Tomohiro Hanada, Nobuhiro Kanahama, Daiki Katoh, Hiroki Ishikawa
{"title":"Mathematical Question Structure Extraction and Possibilities of Automatic Question Making by Plane Graph","authors":"T. Matsuda, M. Sonoda, Masashi Eto, H. Satoh, Tomohiro Hanada, Nobuhiro Kanahama, Daiki Katoh, Hiroki Ishikawa","doi":"10.1145/3371647.3371655","DOIUrl":null,"url":null,"abstract":"This paper proposes an analysis method of mathematic question structure and considers the possibility of automatic question making of mathematics. In previous researches, method for effective usage and automatic generation on multiple choice problems had been considered. When we consider automatic generation of problems, automatic generation of calculation problems such as arithmetic operations can be easily implemented, and some have been implemented as e-learning systems. However, it is not easy to automatically generate the type of problem that derives the answer while applying some formulas. Therefore, in this research, we propose a method to extract the structure of mathematic questions by analyzing problems with induction of university entrance level using the structure of plane graph. A plane graph of mathematic question can be created by using a unit to be learned in a textbook as a vertex and constructing an edge connecting the vertices according to the procedure of inductions. By creating a plane graph in this way, clustering of mathematical problems using information other than learning items and fields, and information to be a hint of new problem creation can be obtained. It is also possible to recommend question structures that are candidates for new questions from such hints. Furthermore, it is also possible to apply it to the development of new teaching materials by giving the examinee's score information to a plane graph.","PeriodicalId":199764,"journal":{"name":"Proceedings of the 2019 3rd International Conference on Education and E-Learning","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2019 3rd International Conference on Education and E-Learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3371647.3371655","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper proposes an analysis method of mathematic question structure and considers the possibility of automatic question making of mathematics. In previous researches, method for effective usage and automatic generation on multiple choice problems had been considered. When we consider automatic generation of problems, automatic generation of calculation problems such as arithmetic operations can be easily implemented, and some have been implemented as e-learning systems. However, it is not easy to automatically generate the type of problem that derives the answer while applying some formulas. Therefore, in this research, we propose a method to extract the structure of mathematic questions by analyzing problems with induction of university entrance level using the structure of plane graph. A plane graph of mathematic question can be created by using a unit to be learned in a textbook as a vertex and constructing an edge connecting the vertices according to the procedure of inductions. By creating a plane graph in this way, clustering of mathematical problems using information other than learning items and fields, and information to be a hint of new problem creation can be obtained. It is also possible to recommend question structures that are candidates for new questions from such hints. Furthermore, it is also possible to apply it to the development of new teaching materials by giving the examinee's score information to a plane graph.