IDEAS home Printed from https://ideas.repec.org/a/taf/japsta/v40y2013i5p961-971.html
   My bibliography  Save this article

Scheduling parallel conference sessions: an application of a novel hybrid clustering algorithm for ensuring constrained cardinality

Author

Listed:
  • B. Houlding
  • J. Haslett

Abstract

The 2011 World Statistics Congress included approximately 1150 oral and 250 poster presentations over approximately 250 sessions, with as many as 20 sessions running in parallel at any one time. Scheduling a timetable for such a conference is hence a complicated task, as ideally, talks on similar topics should be scheduled in the same session, and similar session topics should not be presented at identical times, allowing participants to easily decide which of the number of sessions to attend. Here, we consider a novel hybrid clustering algorithm that allows a solution under a constraint of fixed cardinality, and which is designed to find clusters of highly dense regions whilst forming others from the remaining outlying regions, hence providing a simple, yet data-generated, solution to such scheduling problems.

Suggested Citation

  • B. Houlding & J. Haslett, 2013. "Scheduling parallel conference sessions: an application of a novel hybrid clustering algorithm for ensuring constrained cardinality," Journal of Applied Statistics, Taylor & Francis Journals, vol. 40(5), pages 961-971.
    • Handle: RePEc:taf:japsta:v:40:y:2013:i:5:p:961-971
    DOI: 10.1080/02664763.2012.760239
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/02664763.2012.760239
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/02664763.2012.760239?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:japsta:v:40:y:2013:i:5:p:961-971. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/CJAS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.