Access to Health Services and Locating Health Services March 12, 2013.

Slides:



Advertisements
Similar presentations
Sources and effects of bias in investigating links between adverse health outcomes and environmental hazards Frank Dunstan University of Wales College.
Advertisements

Genome 559: Introduction to Statistical and Computational Genomics Elhanan Borenstein Biological Networks Analysis Introduction and Dijkstras algorithm.
CS 206 Introduction to Computer Science II 04 / 01 / 2009 Instructor: Michael Eckmann.
1 SOFSEM 2007 Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles Eiji Miyano Kyushu Institute of Technology, Japan Joint.
CSE 390B: Graph Algorithms Based on CSE 373 slides by Jessica Miller, Ruth Anderson 1.
CS 206 Introduction to Computer Science II 03 / 27 / 2009 Instructor: Michael Eckmann.
Geographic Access to Primary Care Physicians in New Mexico Prepared for: Geog. 491(Problems) and Geog. 499 (Python programming) Fall Semester, 2014 Larry.
Chapter 8, Part I Graph Algorithms.
CS 206 Introduction to Computer Science II 11 / 07 / 2008 Instructor: Michael Eckmann.
CS171 Introduction to Computer Science II Graphs Strike Back.
Modeling travel distance to health care using geographic information systems Anupam Goel, MD Wayne State University Detroit, MI (USA)
Racial and Geographic Variations in the Use of Tympanostomy Tubes in Young Children in the United States Lawrence C. Kleinman, MD, MPH Departments of Health.
Using ESRI ArcGIS 9.3 Arc ToolBox 3 (Spatial Analyst)
Breadth First Search (BFS) Part 2 COMP171. Graph / Slide 2 Shortest Path Recording * BFS we saw only tells us whether a path exists from source s, to.
Shortest Path Problem For weighted graphs it is often useful to find the shortest path between two vertices Here, the “shortest path” is the path that.
CS 206 Introduction to Computer Science II 03 / 30 / 2009 Instructor: Michael Eckmann.
CS420 lecture eight Greedy Algorithms. Going from A to G Starting with a full tank, we can drive 350 miles before we need to gas up, minimize the number.
Social Media Mining Graph Essentials.
Dijkstra’s Algorithm and Heuristic Graph Search David Johnson.
Spatial Analysis cont. Optimization Network Analysis, Routing.
Adaptive Kernel Density in Demographic Analysis Richard Lycan Institute on Aging Portland State University.
CSCI-455/552 Introduction to High Performance Computing Lecture 18.
Computer Science 112 Fundamentals of Programming II Graph Algorithms.
1 TCOM 5143 Telecommunications Analysis, Planning and Design Lecture 6 Network Design and Graph Theory: part 2 Shortest Path trees and Tours.
Fundamentals, Terminology, Traversal, Algorithms Graph Algorithms Telerik Algo Academy
ALG0183 Algorithms & Data Structures Lecture 21 d Dijkstra´s algorithm 8/25/20091 ALG0183 Algorithms & Data Structures by Dr Andy Brooks Chapter 14 Weiss.
Crystal Linkletter and Derek Bingham Department of Statistics and Actuarial Science Simon Fraser University Acknowledgements This research was initiated.
15. Descriptive Summary, Design, and Inference. Outline Data mining Descriptive summaries Optimization Hypothesis testing.
Demographic and Spatial Analysis of North Carolina's Nuclear Plants Mike Team Raleigh, NC GIS Masters Degree Student Advisor – Frank Hardisty, Ph.D.
Shortest Path Problem Weight of the graph –Nonnegative real number assigned to the edges connecting to vertices Weighted graphs –When a graph.
Researchers: Preet Bola Mike Earnest Kevin Varela-O’Hara Han Zou Advisor: Walter Rusin Data Storage Networks.
1 Optimal Cycle Vida Movahedi Elder Lab, January 2008.
Computer Science Club It is easier to change the specification to fit the program than vice versa.
The State Innovation Model Grant A Measurement Approach to Achieve the Triple Aim 1.
Graphs. Definitions A graph is two sets. A graph is two sets. –A set of nodes or vertices V –A set of edges E Edges connect nodes. Edges connect nodes.
Geographic Information Systems
Jan Kamenický.  Many features ⇒ many dimensions  Dimensionality reduction ◦ Feature extraction (useful representation) ◦ Classification ◦ Visualization.
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
Raster Analysis and Terrain Analysis Chapter 10 & 11 Raster Analysis.
CCR = Connectivity Residue Ratio = Pr. [ node pair connected by an edge are together in a common page on computer disk drive.] “U of M Scientists were.
Buffalo Urban Development Simulator (BUDS) “SimCity”-like simulation for downtown and waterfront development Produce a game, like SimCity, in which Buffalo.
Technical Details of Network Assessment Methodology: Concentration Estimation Uncertainty Area of Station Sampling Zone Population in Station Sampling.
John Whalen, M.A. Department of Geography
Locating Pollutant Zones In Michigan: Analyzing Health And Environmental Justice Problems Presented To Dr. Ronald Briggs Course: GISC 6387 By Rumana Reaz.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
Technical Details of Network Assessment Methodology: Concentration Estimation Uncertainty Area of Station Sampling Zone Population in Station Sampling.
NAACCR’S National Provider Identifier Resource Kevin Henry Frank Boscoe Chris Johnson NAACCR GIS Committee June 10, 2008.
TruVue LLC Visual Decision Support Tools TruVue provides location-based solutions to the healthcare industry for facility and physician network optimization.
NAACCR 2006 Conference NAACCR SHOWCASE Great Circle Distance Calculator Chris Johnson NAACCR GIS Committee Cancer Data Registry of Idaho.
©2011 Walgreen Co. All rights reserved. Community Pharmacy Impact on Access to Immunizations for Health Professional Shortage Areas Patricia Murphy, MPH.
Management Science 461 Lecture 4b – P-median problems September 30, 2008.
Graph Search Applications, Minimum Spanning Tree
Speed.
Summary of Prev. Lecture
Raster Analysis and Terrain Analysis
Discrete Math 2 Weighted Graph Search Tree
Single-Source Shortest Paths
Pediatric Trauma Care in Harris County, Texas- How do we Fare?
Comp 245 Data Structures Graphs.
Discussion section #2 HW1 questions?
Discussion section #2 HW1 questions?
CSE 373: Data Structures and Algorithms
Louisiana Travels.
A path that uses every vertex of the graph exactly once.
Shortest Path Algorithm for Weighted Non-negative Undirected Graphs
CE 221 Data Structures and Algorithms
Dijkstra's Shortest Path Algorithm
CE 221 Data Structures and Algorithms
Graphs: Shortest path and mst
The National Institutes of Allergy and Infectious Diseases networks on asthma in inner- city children: An approach to improved care  William W. Busse,
Presentation transcript:

Access to Health Services and Locating Health Services March 12, 2013

Haynes RM et al Effects of distances to hospital and GP surgery on hospital inpatient episodes, controlling for needs and provision. Social Science and Medicine 49(3):

from Athas WF et al Travel Distance to Radiation Therapy and Receipt of Radiotherapy Following Breast-Conserving Surgery. Journal of the National Cancer Institute 92(3):

Distance Decay function example

Firla 2007

Fulcher C, Kaukinen C Mapping and visualizing the location HIV service providers: an exploratory spatial analysis of Toronto neighborhoods. AIDS Care 17(3):

Firla 2007

Finding the shortest path

London Travel- Time Map

A.Walking only B.Car + walking C.Bus + walking D.Bicycle + walking Health care accessibility in southern Malawi Ray and Ebener, Int J Health Geographics 2008; 7: 63.

Klein et al., JAMA 2009; 302:

Dykstra’s shortest-path algorithm 1. Assign to every node a distance value: set it to zero for our initial node and to infinity for all other nodes. 2.Mark all nodes as unvisited. Set initial node as current. 3.For current node, consider all its unvisited neighbors and calculate their tentative distance. For example, if current node (A) has distance of 6, and an edge connecting it with another node (B) is 2, the distance to B through A will be 6+2=8. If this distance is less than the previously recorded distance, overwrite the distance. 4.When we are done considering all neighbors of the current node, mark it as visited. A visited node will not be checked ever again; its distance recorded now is final and minimal. 5.If all nodes have been visited, finish. Otherwise, set the unvisited node with the smallest distance (from the initial node, considering all nodes in graph) as the next "current node" and continue from step 3.

Shortest path example

Boscoe, Henry, Zdeb 2012

Mike Zdeb - Driving Distances and Drive Times using SAS and Google Maps: _SAS_and_Google_Maps Also: Boscoe FP, Henry KA and Zdeb MS. A Nationwide Comparison of Driving Distance Versus Straight Line Distance to Hospitals. Professional Geographer 2012; 64(2):

Fu LY et al Spatial accessibility to providers and vaccination compliance among children with Medicaid. Pediatrics 124:

Spatial accessibility = ratio of pediatric providers to pediatric population Provider density: Number of providers, weighted by specialty, smoothed with a Gaussian kernel density function of 3 miles Population density: Number of children under 18, using 2000 census block group data, smoothed over a 1 mile radius Results: Areas with the highest spatial accessibility had 36% more vaccination compliance than areas with the lowest spatial accessibility

Total population to be served = 10,000 Mean location = 6 Median location = 5 Modal location = 2 Range midpoint = 8

Allocation model – given a fixed set of facilities, figure out how to assign resources optimally Location model – identifies the best NEW location for a facility Location-allocation models do both of these things.

Smallman-Raynor MR, Muir KR, Smith SJ The geographical assignment of cancer units: patient accessibility as an optimal allocation problem. Public Health 112:

Predictions of NO and NO 2 concentrations. A location-allocation model was used to site the 102 air monitors. Criteria were (1) monitors should be in areas where pollution exhibits high variability (2) where population density is high Su et al. Environmental Research 2009; 109:

Bell 2013