End of last year I spent a month as a guest researcher at Numenta, a machine intelligence company in Redwood City, CA – I mentioned them in an earlier post on sparse distributed representations. They recently started a visiting scholar…

When reading about sequence learning and the prediction of elements in a time series you inevitably cross paths with the area of sequence compression at some point, and so did I. In the present post I’d like to outline a…

A PDF version of this post can be found here. Quite a while ago I stumbled over the white paper [3] of a science startup called Numenta. At the core of the paper lies the model of a sequence memory that enables…

A few posts ago I wrote about the mapper construction by Carlsson-Memoli-Singh and want to follow up on that a little. I wrote a straightforward implementation of the construction in Python. It can be found here: github.com/mirkoklukas/tda-mapper-py.

This is the 4th of a series of posts on cluster-algorithms and ideas in data analysis. The $k$-Means algorithm computes a Voronoi partition of the data set such that each landmark is given by the centroid of the corresponding cell….

This is the third of a series of posts on cluster-algorithms and ideas in data analysis. Mapper is a construction that uses a given cluster-algorithm to associate a simplicial complex to a reference map on a given data set. It…

This is the second of a series of posts on cluster-algorithms and ideas in data analysis (and related fields). Ordering points to identify the clustering structure (OPTICS) is a data clustering algorithm presented by Mihael Ankerst, Markus M. Breunig, Hans-Peter…

This is the first of a series of posts on cluster-algorithms and ideas in data analysis (and related fields). Density-based spatial clustering of applications with noise (DBSCAN) is a data clustering algorithm proposed by Martin Ester, Hans-Peter Kriegel, Jörg Sander…