.

Faramarz Azadegan's Blog (2)

Python Software for Clustering

In an earlier description of clustering algorithms we described an algorithm by which locally optimum partitions and center of gravity of multi-dimensional vectors/points may be obtained. If only one or two dimensional data are considered the optimum partitioning to obtain the so-called Voronoi regions are known. For one-dimension it is the interval while for two-dimensions it is hexagon (think of honey-bee nests or cellular…

Continue

Added by Faramarz Azadegan on June 19, 2019 at 9:35am — No Comments

Clustering – Algorithms for Partitioning and Assignments

K-means algorithm is a popular and efficient approach for clustering and classification of data. My first introduction to K-means algorithm was when I was conducting research on image compression. In this applications, the purpose of clustering was to provide the ability to represent a group of objects or vectors by only one object/vector with an acceptable loss of information. More specifically, a clustering process in which the centroid of the cluster was optimum for the cluster and the…

Continue

Added by Faramarz Azadegan on October 31, 2018 at 7:06am — No Comments

© 2021   TechTarget, Inc.   Powered by

Badges  |  Report an Issue  |  Privacy Policy  |  Terms of Service