In this paper, we examine whether it is possible to automatically classify patterns of interactions using a state transition model and identify successful versus unsuccessful student Q&A discussions. For state classification, we apply Conditional Random Field and Hidden Markov Models to capture transitions among the states. The initial results indicate that such models are useful for modeling some of the student dialogue states. We also show the results of classifying threads as successful/unsuccessful using the state information. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Seo, S. W., Kang, J. H., Drummond, J., & Kim, J. (2011). Using graphical models to classify dialogue transition in online Q&A discussions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6738 LNAI, pp. 550–553). https://doi.org/10.1007/978-3-642-21869-9_98
Mendeley helps you to discover research relevant for your work.