Which clustering algorithm is suitable for one-dimensional Lists without knowing k?

前端 未结 2 875
-上瘾入骨i
-上瘾入骨i 2021-01-15 11:03

I have a one dimensional List like this

public class Zeit_und_Eigenschaft
{
    [Feature]
    public double Sekunden { get; set; }
}

//...
List

        
2条回答
  •  梦谈多话
    2021-01-15 11:52

    There was a good article in MSDN magazine on this topic a few months ago. They used the k-means algorithm. Link:

    http://msdn.microsoft.com/en-us/magazine/jj891054.aspx

    Also, there are some videos on k-means clustering as part of Andrew Ng's online machine learning class. Link:

    https://class.coursera.org/ml-003/lecture/preview

    When you don't know k, there are some algorithms to search for a good value. Do a web search for k-means + elbow.

提交回复
热议问题