Subtree Mining for Question Classification Problem
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 1695-1699.
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.
@inproceedings{ijcai2007p274,
title = {Subtree Mining for Question Classification Problem},
author = {Le Nguyen, Minh and Tri, Nguyen Thanh and Shimazu, Akira},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {1695--1699},
year = {2007},
url = {https://ijcai.org/proceedings/2007/274},
}
TY - CPAPER TI - Subtree Mining for Question Classification Problem AU - Le Nguyen, Minh AU - Tri, Nguyen Thanh AU - Shimazu, Akira T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 1695 EP - 1699 UR - https://ijcai.org/proceedings/2007/274 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
