Hey there,
It was nice seeing some of you at the Bike Hack Night. Thanks for coming out to hear me blabber about cycleways in OpenStreetmap! I'm not 100% sure what happens in the NoVa Brigade group, but i'm learning quick, and i think this idea may be interesting to some of you. At least it would be nice to get some feedback and thanks in advance.
It's about gerrymandering and how to use Census data plus a clustering algorithm to build the voting districts. While working on a k-means clustering activity for something at work, this was published: http://bmander.com/dotmap/index.html
Sorry looks like the Dotmap is busted. See http://geographyeducation.org/2013/01/01/u-s-census-dotmap/
And it got me thinking, i could apply clustering to these dots, i mean people! K-means goes like this: http://statistical-research.com/spatial-clustering-with-equal-sizes/
But i'd do it for 1 county at a time. The algorithm uses a "distance" function. And i'd hope to use a walking distance instead of how the crow flies, type of distance function. And that's where my instance of OSRM comes into play (http://mappingdc.org/osrm).
Thoughts? I would be glad to do all the coding, but i need help with ideas, some research, and publishing the results.
I'd like to attend this hackathon on May 31, but not sure if i'll have time. I may have family obligations to take my daughter to the playground, and of course collect details for City of Alexandria ;)
Brian
PS: A few years ago DC gov had a small web app to build districts. Does anyone know where that is?
--