clustering algorithims

 Kinda work related, but will be my one way dive into ML

One dimensional clustering (interesting and not talked about):

Firstly, I am interested in performing one dimensional clustering. I found a similar problem on stack... where, my input array is [1,1,2,3,10,11,13,67,71]my desired output clusters are[[1,1,2,3],[10,11,13],[67,71]].


Suggested answer: "Don't use multidimensional clustering algorithms for a one-dimensional problem. A single dimension is much more special than you naively think, because you can actually sort it, which makes things a lot easier.

In fact, it is usually not even called clustering, but e.g. segmentation or natural breaks optimization.""

1. I need to perform, Jenk's natural break optimization.
   
2. Kernel density estimation is also a credible method of this clustering.

Two or more dimensional clustering:

Can use K-means Clustering