I’ve been too busy to update this blog but I have an upcoming presentation on my research about holes in multi dimensional data where I plan to present a new algorithm that can quickly generate useful results.
One of the big problems is that (until now) there are no algorithms that scale well for finding empty hyper-rectangles.
This is related to something called “The curse of dimensionality”.
My wife is finishing up a drawing(she’s an artist) to include in my presentation and I’m to tired to keep working so I figured I’d post something about the curse here.
Here are some interesting lecture notes on The curse of dimensionality: http://math.arizona.edu/~hzhang/math574m/2014Lect10_curse.pdf