IDEAS home Printed from https://ideas.repec.org/a/taf/raagxx/v109y2019i5p1493-1510.html
   My bibliography  Save this article

Choropleth Mapping with Uncertainty: A Maximum Likelihood–Based Classification Scheme

Author

Listed:
  • Wangshu Mu
  • Daoqin Tong

Abstract

Choropleth mapping provides a powerful way to visualize geographical phenomena with colors, shadings, or patterns. In many real-world applications, geographical data often contain uncertainty. How to incorporate such uncertainty into choropleth mapping is challenging. Although a few existing methods attempt to address the uncertainty issue in choropleth mapping, there are limitations to widely applying these methods due to their strong assumption on the distribution of uncertainty and the way in which similarity or dissimilarity is assessed. This article provides a new classification scheme for choropleth maps when data contain uncertainty. Considering that in a choropleth map, units in the same class are assigned with the same color or pattern, this new approach assumes the existence of a representative value for each class. A maximum likelihood estimation–based approach is developed to determine class breaks so that the overall within-class deviation is minimized while considering uncertainty. Different methods—including linear programming, dynamic programming, and an interchange heuristic—are developed to solve the new classification problem. The proposed mapping approach has been applied to map the median household income data from the American Community Survey and simulated disease occurrence data. Test results show the effectiveness of the new approach. The linkage between the new approach and the existing methods is also discussed. Key Words: choropleth mapping, map classification, maximum likelihood estimation, uncertainty.

Suggested Citation

  • Wangshu Mu & Daoqin Tong, 2019. "Choropleth Mapping with Uncertainty: A Maximum Likelihood–Based Classification Scheme," Annals of the American Association of Geographers, Taylor & Francis Journals, vol. 109(5), pages 1493-1510, September.
  • Handle: RePEc:taf:raagxx:v:109:y:2019:i:5:p:1493-1510
    DOI: 10.1080/24694452.2018.1549971
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/24694452.2018.1549971?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.

    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:raagxx:v:109:y:2019:i:5:p:1493-1510. 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/raag .

    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.