The dataset contains 54 transcribed one-on-one tutoring sessions on computer science introductory data structures (transcripts table). The data structures in question are linked lists, stacks and binary search trees. The transcripts are annotated for the following tutoring moves / strategies (annotations table):
- Positive Feedback (+FB)
- Negative Feedback (-FB)
- Direct Procedural Instruction (DPI)
- Direct Declarative Instruction (DDI)
- Student Initiative (SI)
- Prompt (PT)
- Worked Out Example (WOE)
- Analogy
The first 6 tags (+FB, -FB, DPI, DDI, SI, PT) are turn level annotations; the last two (WOE and Analogy) are multiturn annotations, that are marked in the transcripts with Begin and End markers on the turns that begin and end the strategy, respectively.
Because of human protection requirements, we are unable to release audio and video (the video was limited to the hands of the student and the tutor, and the papers they had in front of them)
The interested reader may refer to the following papers for more details:
-
Di Eugenio, B., Fossati, D., Ohlsson, S., & Cosejo, D. (2009). Towards explaining effective tutorial dialogues. In Annual Meeting of the Cognitive Science Society (pp. 1430-1435).
-
Di Eugenio, B., Chen, L., Green, N., Fossati, D., & AlZoubi, O. (2013, July). Worked out examples in computer science tutoring. In International Conference on Artificial Intelligence in Education (pp. 852-855). Springer, Berlin, Heidelberg.
-
Alizadeh, M., Di Eugenio, B., Harsley, R., Green, N., Fossati, D., & AlZoubi, O. (2015, May). A Study of Analogy in Computer Science Tutorial Dialogues. In Proceedings of the 7th International Conference on Computer Supported Education-Volume 2 (pp. 232-237). SCITEPRESS-Science and Technology Publications, Lda.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
For SQLite format / alternative access of the data, please refer to http://digitaltutor.net/chiqat/pages/database.php