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

Conference scheduling Optimization Topic modeling

Journal

PeerJ. Computer science
ISSN: 2376-5992
Titre abrégé: PeerJ Comput Sci
Pays: United States
ID NLM: 101660598

Informations de publication

Date de publication:
2019
Historique:
received: 21 01 2019
accepted: 15 10 2019
entrez: 5 4 2021
pubmed: 11 11 2019
medline: 11 11 2019
Statut: epublish

Résumé

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.

Identifiants

pubmed: 33816887
doi: 10.7717/peerj-cs.234
pii: cs-234
pmc: PMC7924486
doi:

Types de publication

Journal Article

Langues

eng

Pagination

e234

Informations de copyright

©2019 Manda et al.

Déclaration de conflit d'intérêts

Todd J. Vision is an Academic Editor for PeerJ. Katherine Lamm is employed by ROI Revolution, Inc.

Références

Science. 1983 May 13;220(4598):671-80
pubmed: 17813860

Auteurs

Prashanti Manda (P)

Department of Computer Science, University of North Carolina at Greensboro, Greensboro, NC, United States of America.

Alexander Hahn (A)

Department of Computer Science, University of Southern California, Los Angeles, United States of America.

Katherine Beekman (K)

ROI Revolution Inc., Raleigh, NC, United States of America.

Todd J Vision (TJ)

Department of Biology, University of North Carolina at Chapel Hill, Chapel Hill, NC, United States of America.

Classifications MeSH