对一维数据使用哪种聚类算法？ [英] What clustering algorithm to use on 1-d data?

问题描述

我在数组中有一个数字列表。每个元素的索引是X，值是Y。如何对这些数据进行分区/集群？
如果我有一个数组，我只想要一组标记每个分区结尾的值。由于我正在使用Python，因此请提及是否有库可以做到这一点。

谢谢。

K均值算法 http://en.wikipedia.org/wiki/K- means_clustering

强烈建议正确的K-Means初始化 http://en.wikipedia.org/wiki/K-means%2B%2B 照原样。

如果您对K-Means不满意，则可以将EM算法与高斯混合（ http：// en.wikipedia.org/wiki/Mixture_model ），不太难编写代码，您可以使用K-Means对其进行初始化！

这些已实现使用Python 100次，请检查任何机器学习工具箱。

I have a list of numbers in an array. The index of each element is X and the value is Y. How do i go about partitioning/clustering this data? If i had an array, i just want a set of values which mark the end of each partition. Since I'm working on Python, please do mention if there are libraries to do the same.

Thanks.

解决方案

K-Means is a very simple clustering algorithm, I would say the first to test before going for more complex things. The K-Means algorithm http://en.wikipedia.org/wiki/K-means_clustering

Proper K-Means initialization is strongly advised http://en.wikipedia.org/wiki/K-means%2B%2B, as it.

If you're not happy with K-Means, then you use EM algorithm with Gaussian mix ( http://en.wikipedia.org/wiki/Mixture_model ), not too hard to code and you can use K-Means to initialize it !

Those have been implemented 100 times in Python, check any machine learning toolbox.

这篇关于对一维数据使用哪种聚类算法？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！