A subsequent speaker selection method for online discussions based on the multi-armed bandit algorithm

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a method to select subsequent speakers in an online discussion, which is one of the important functions of facilitators, using the multi-armed bandit algorithm. Bandit algorithms can be applied to speaker determination by considering each participant as an arm of a slot machine and a facilitator as a player. We define a “discussion score” to evaluate each post, and it is then considered to be equivalent to the reward of the slot machine method. The discussion score of each post is defined based on the following three metrics: (1) Whether the post helps to settle a discussion or not. (2) How interested are the other participants in the post (3) The intention of the post. To consider conflict between participants, our method classifies the participants into groups and determines the next speaker based on clustering results. We demonstrate that our method can select participants who posted good ideas and opinions and promote participants to engage other participants by using questionnaires.

Cite

CITATION STYLE

APA

Kurii, M., & Fujita, K. (2018). A subsequent speaker selection method for online discussions based on the multi-armed bandit algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11013 LNAI, pp. 404–411). Springer Verlag. https://doi.org/10.1007/978-3-319-97310-4_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free