Conflict recognition in CSCL sessions through the identification of cycles in conversational graphs
Leobardo Pérez Martínez
/ Categorías: Unidad Tamaulipas

Conflict recognition in CSCL sessions through the identification of cycles in conversational graphs

Jose Torres-Jimenez, Germán Lescano, Carlos Lara-Alvarez and Hugo Mitre-Hernández.

Abstract

Conflicts play an important role to improve group learning effectiveness; they can be decreased, increased, or ignored. Given the sequence of messages of a collaborative group, we are interested in recognizing conflicts (detecting whether a conflict exists or not). This is not an easy task because of different types of natural language ambiguities. A conversation can be represented as a conversation graph; i.e., a direct multidigraph where the nodes are users, and an edge means a message. The approach proposed in this paper focuses on the emotional interactions of group members. Hence, to detect conflicts it analyzes emotions involved in the cycles of the graph. This strategy has the advantages of considering the sentiment of a sequence of messages to take a better decision and analyzing interactions with two or more participants. The proposed approach has been tested in collaborative learning tasks, achieving an F1 score of 92.6%, and a 90.1% recall score for conflicting situations. This approach can help teachers and students to improve the learning process.

 

https://doi.org/10.1007/s10639-022-11576-6
 

Artículo anterior Machine learning based study for the classification of Type 2 diabetes mellitus subtypes
Siguiente artículo Population-based iterated greedy algorithm for the S-labeling problem
Print
464 Califica este artículo:
Sin calificación
Orden de presentación (texto):2023, 02
Please login or register to post comments.
CONTÁCTENOS

Logo Cinvestav

Av. Instituto Politécnico Nacional 2508
Col. San Pedro Zacatenco, Alcaldía Gustavo A. Madero
Ciudad de México, C.P. 07360
Apartado Postal: 14-740, 07000 Ciudad de México

Tel. +52 (55) 5747 3800

Cinvestav © 2025
05/03/2025 12:40:47 p. m.