--kmeans Algorithm of Clustering algorithm

Source: Internet
Author: User

Clustering concepts

Unsupervised problem: We don't have a label in hand.

Clustering: Something similar is divided into a group

Difficulties: How to evaluate, how to adjust the parameters

    

Basic concepts

To get the number of clusters, you need to specify a K value

Centroid: Mean, that is, the average of vector dimensions can be

Measure of distance: Euclidean distance and cosine (normalized first)

Optimization objectives:

        

Work Flow:

        

Advantage:

Simple, fast, and suitable for general data sets

Disadvantage:

K value difficult to determine

The complexity is linearly related to the sample

It is difficult to find clusters of arbitrary shapes

      

--kmeans Algorithm of Clustering algorithm

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.