{"type":"ScholarlyArticle","title":"Subtree Mining for Question Classification Problem","authors":[{"name":"Minh Le Nguyen","slug":"minh-le-nguyen","given":"Minh","family":"Le Nguyen","affiliation":""},{"name":"Nguyen Thanh Tri","slug":"nguyen-thanh-tri","given":"Nguyen Thanh","family":"Tri","affiliation":""},{"name":"Akira Shimazu","slug":"akira-shimazu","given":"Akira","family":"Shimazu","affiliation":""}],"abstract":"Question Classification, i.e., putting the questions into several semantic categories, is very important for question answering. This paper introduces a new application of using subtree mining for question classification problem. First, we formulate this problem as classifying a tree to a certain label among a set of labels. We then present a use of subtrees in the forest created by the training data to the tree classification problem in which maximum entropy and a boosting model are used as classifiers. Experiments on standard question classification data show that the uses of subtrees along with either maximum entropy or boosting models are promising. The results indicate that our method achieves a comparable or even better performance than kernel methods and also improves testing efficiency.","doi":null,"url":"https://ijcai.org/proceedings/2007/274","pdf":"https://ijcai.org/proceedings/2007/0274.pdf","markdown":"https://ijcai.org/proceedings/2007/274.md","bibtex":"https://ijcai.org/proceedings/2007/bibtex/274","volume":{"slug":"2007","title":"Proceedings of the Twentieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2007","url":"https://ijcai.org/proceedings/2007/","year":2007,"location":"Hyderabad, India","dates":"","editors":"Ramon López de Mántaras","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":274,"pages":{"first":1695,"last":1699},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}