Can you suggest any quick and simple clustering analyses, for univariate real-valued data? In other words, I have $n$ real numbers, $x_1,\dots,x_n$ where $x_i \in \mathbb{R}^+$, and I want to cluster them. I don't know a priori the best number of clusters, so that's something the method would need to discover as well.
It'd be nice if it were simple to code up in Python. Something quick and dirty -- say, easy to understand, easy to implement, and pretty effective-- beats something complex but optimal.
My motivation: As mentioned elsewhere, in the application in front of me now, a reasonable model would be to say that the points were generated from a mixture of Gaussians. I don't know the parameters of the mixture model, but if it helps, I can reasonably assume some lower bound on the probability of each component: for instance, if you like concrete numbers, you could imagine I have $n=40,000$ samples and each component of the mixture model is guaranteed to have proability at least $0.0001$. A twist is that there may be a few outliers thrown in as well, and I want to detect the outliers. @whuber suggested that a good approach to outlier detection would be to start by clustering the points, so I'm looking for quick-and-dirty clustering methods. That's my motivation at the moment -- but I expect the broader question is of general, independent interest, so feel free to ignore this specific motivation.