Cargando…

Avoiding “conflicts of interest”: a computational approach to scheduling parallel conference tracks and its human evaluation

Conferences with contributed talks grouped into multiple concurrent sessions pose an interesting scheduling problem. From an attendee’s perspective, choosing which talks to visit when there are many concurrent sessions is challenging since an individual may be interested in topics that are discussed...

Descripción completa

Detalles Bibliográficos
Autores principales: Manda, Prashanti, Hahn, Alexander, Beekman, Katherine, Vision, Todd J.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: PeerJ Inc. 2019
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7924486/
https://www.ncbi.nlm.nih.gov/pubmed/33816887
http://dx.doi.org/10.7717/peerj-cs.234
_version_ 1783659100504064000
author Manda, Prashanti
Hahn, Alexander
Beekman, Katherine
Vision, Todd J.
author_facet Manda, Prashanti
Hahn, Alexander
Beekman, Katherine
Vision, Todd J.
author_sort Manda, Prashanti
collection PubMed
description Conferences with contributed talks grouped into multiple concurrent sessions pose an interesting scheduling problem. From an attendee’s perspective, choosing which talks to visit when there are many concurrent sessions is challenging since an individual may be interested in topics that are discussed in different sessions simultaneously. The frequency of topically similar talks in different concurrent sessions is, in fact, a common cause for complaint in post-conference surveys. Here, we introduce a practical solution to the conference scheduling problem by heuristic optimization of an objective function that weighs the occurrence of both topically similar talks in one session and topically different talks in concurrent sessions. Rather than clustering talks based on a limited number of preconceived topics, we employ a topic model to allow the topics to naturally emerge from the corpus of contributed talk titles and abstracts. We then measure the topical distance between all pairs of talks. Heuristic optimization of preliminary schedules seeks to balance the topical similarity of talks within a session and the dissimilarity between concurrent sessions. Using an ecology conference as a test case, we find that stochastic optimization dramatically improves the objective function relative to the schedule manually produced by the program committee. Approximate Integer Linear Programming can be used to provide a partially-optimized starting schedule, but the final value of the discrimination ratio (an objective function used to estimate coherence within a session and disparity between concurrent sessions) is surprisingly insensitive to the starting schedule. Furthermore, we show that, in contrast to the manual process, arbitrary scheduling constraints are straightforward to include. We applied our method to a second biology conference with over 1,000 contributed talks plus scheduling constraints. In a randomized experiment, biologists responded similarly to a machine-optimized schedule and a highly modified schedule produced by domain experts on the conference program committee.
format Online
Article
Text
id pubmed-7924486
institution National Center for Biotechnology Information
language English
publishDate 2019
publisher PeerJ Inc.
record_format MEDLINE/PubMed
spelling pubmed-79244862021-04-02 Avoiding “conflicts of interest”: a computational approach to scheduling parallel conference tracks and its human evaluation Manda, Prashanti Hahn, Alexander Beekman, Katherine Vision, Todd J. PeerJ Comput Sci Artificial Intelligence Conferences with contributed talks grouped into multiple concurrent sessions pose an interesting scheduling problem. From an attendee’s perspective, choosing which talks to visit when there are many concurrent sessions is challenging since an individual may be interested in topics that are discussed in different sessions simultaneously. The frequency of topically similar talks in different concurrent sessions is, in fact, a common cause for complaint in post-conference surveys. Here, we introduce a practical solution to the conference scheduling problem by heuristic optimization of an objective function that weighs the occurrence of both topically similar talks in one session and topically different talks in concurrent sessions. Rather than clustering talks based on a limited number of preconceived topics, we employ a topic model to allow the topics to naturally emerge from the corpus of contributed talk titles and abstracts. We then measure the topical distance between all pairs of talks. Heuristic optimization of preliminary schedules seeks to balance the topical similarity of talks within a session and the dissimilarity between concurrent sessions. Using an ecology conference as a test case, we find that stochastic optimization dramatically improves the objective function relative to the schedule manually produced by the program committee. Approximate Integer Linear Programming can be used to provide a partially-optimized starting schedule, but the final value of the discrimination ratio (an objective function used to estimate coherence within a session and disparity between concurrent sessions) is surprisingly insensitive to the starting schedule. Furthermore, we show that, in contrast to the manual process, arbitrary scheduling constraints are straightforward to include. We applied our method to a second biology conference with over 1,000 contributed talks plus scheduling constraints. In a randomized experiment, biologists responded similarly to a machine-optimized schedule and a highly modified schedule produced by domain experts on the conference program committee. PeerJ Inc. 2019-11-11 /pmc/articles/PMC7924486/ /pubmed/33816887 http://dx.doi.org/10.7717/peerj-cs.234 Text en ©2019 Manda et al. https://creativecommons.org/licenses/by/4.0/ This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ Computer Science) and either DOI or URL of the article must be cited.
spellingShingle Artificial Intelligence
Manda, Prashanti
Hahn, Alexander
Beekman, Katherine
Vision, Todd J.
Avoiding “conflicts of interest”: a computational approach to scheduling parallel conference tracks and its human evaluation
title Avoiding “conflicts of interest”: a computational approach to scheduling parallel conference tracks and its human evaluation
title_full Avoiding “conflicts of interest”: a computational approach to scheduling parallel conference tracks and its human evaluation
title_fullStr Avoiding “conflicts of interest”: a computational approach to scheduling parallel conference tracks and its human evaluation
title_full_unstemmed Avoiding “conflicts of interest”: a computational approach to scheduling parallel conference tracks and its human evaluation
title_short Avoiding “conflicts of interest”: a computational approach to scheduling parallel conference tracks and its human evaluation
title_sort avoiding “conflicts of interest”: a computational approach to scheduling parallel conference tracks and its human evaluation
topic Artificial Intelligence
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7924486/
https://www.ncbi.nlm.nih.gov/pubmed/33816887
http://dx.doi.org/10.7717/peerj-cs.234
work_keys_str_mv AT mandaprashanti avoidingconflictsofinterestacomputationalapproachtoschedulingparallelconferencetracksanditshumanevaluation
AT hahnalexander avoidingconflictsofinterestacomputationalapproachtoschedulingparallelconferencetracksanditshumanevaluation
AT beekmankatherine avoidingconflictsofinterestacomputationalapproachtoschedulingparallelconferencetracksanditshumanevaluation
AT visiontoddj avoidingconflictsofinterestacomputationalapproachtoschedulingparallelconferencetracksanditshumanevaluation