IDEAS home Printed from https://ideas.repec.org/a/taf/intgms/v16y2016i2p193-210.html
   My bibliography  Save this article

Predicting online gambling self-exclusion: an analysis of the performance of supervised machine learning models

Author

Listed:
  • Christian Percy
  • Manoel França
  • Simo Dragičević
  • Artur d’Avila Garcez

Abstract

As gambling operators become increasingly sophisticated in their analysis of individual gambling behaviour, this study evaluates the potential for using machine learning techniques to identify individuals who used self-exclusion tools out of a sample of 845 online gamblers, based on analysing trends in their gambling behaviour. Being able to identify other gamblers whose behaviour is similar to those who decided to use self-exclusion tools could, for instance, be used to share responsible gaming messages or other information that aids self-aware gambling and reduces the risk of adverse outcomes. However, operators need to understand how accurate models can be and which techniques work well. The purpose of the article is to identify the most accurate technique out of four highly diverse techniques and to discuss how to deal analytically and practically with a rare event like self-exclusion, which was used by fewer than 1% of gamblers in our data-set. We conclude that balanced training data-sets are necessary for creating effective models and that, on our data-set, the most effective method is the random forest technique which achieves an accuracy improvement of 35 percentage points versus baseline estimates.

Suggested Citation

  • Christian Percy & Manoel França & Simo Dragičević & Artur d’Avila Garcez, 2016. "Predicting online gambling self-exclusion: an analysis of the performance of supervised machine learning models," International Gambling Studies, Taylor & Francis Journals, vol. 16(2), pages 193-210, August.
  • Handle: RePEc:taf:intgms:v:16:y:2016:i:2:p:193-210
    DOI: 10.1080/14459795.2016.1151913
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/14459795.2016.1151913
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/14459795.2016.1151913?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:intgms:v:16:y:2016:i:2:p:193-210. 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/RIGS20 .

    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.