# K-평균 알고리즘

둘러보기로 가기 검색하러 가기

## 노트

### 말뭉치

1. In k-means clustering, a single object cannot belong to two different clusters.[1]
2. So, why restrict your learning to merely K-means clustering?[1]
3. In the second stage, we use the k-means clustering algorithm to cluster the selected subset and find the proper cluster centers as the true cluster centers of the original data set.[2]
4. The details of two-stage k-means clustering algorithm and its pseudocode are presented in Section 3.[2]
5. The main idea of our two-stage k-means clustering algorithm is that we only need to deal with a small subset of which has a similar clustering structure to .[2]
6. In Table 1, we can see that our proposed algorithm obtains the larger ARIs with the lower time consumption in comparison with k-means clustering algorithm on these synthetic data sets.[2]
7. The basic idea behind k-means clustering consists of defining clusters so that the total intra-cluster variation (known as total within-cluster variation) is minimized.[3]
8. The first step when using k-means clustering is to indicate the number of clusters (k) that will be generated in the final solution.[3]
9. The k-means clustering requires the users to specify the number of clusters to be generated.[3]
10. As k-means clustering algorithm starts with k randomly selected centroids, it’s always recommended to use the set.seed() function in order to set a seed for R’s random number generator.[3]
11. Constrained k-means clustering using constraints as background knowledge, although easy to implement and quick, has insufficient performance compared with metric learning-based methods.[4]
12. “Constrained k-means clustering with background knowledge,” in Proceedings of the 18th International Conference on Machine Learning, Williamstown, 577–584.[4]
14. The Euclidean distance is commonly used as a measure of cluster scatter for K-means clustering.[5]
15. kmeans performs k-means clustering to partition data into k clusters.[6]
16. The solution to the K-means clustering problem is hard, and it has been proven that it is NP-hard, which justifies the use of heuristic methods for its solution.[7]
17. K-means clustering is a type of unsupervised learning, which is used when you have unlabeled data (i.e., data without defined categories or groups).[8]
18. The K-means clustering algorithm is used to find groups which have not been explicitly labeled in the data.[8]
19. Properties of Clusters Applications of Clustering in Real-World Scenarios Understanding the Different Evaluation Metrics for Clustering What is K-Means Clustering?[9]
20. K-Means Clustering How to choose the Right Number of Clusters in K-Means?[9]
21. Next, we will define some conditions to implement the K-Means Clustering algorithm.[9]
22. Remember how we randomly initialize the centroids in k-means clustering?[9]
23. It is easy to understand, especially if you accelerate your learning using a K-means clustering tutorial.[10]
24. In this example, the result of k-means clustering (the right figure) contradicts the obvious cluster structure of the data set.[11]
25. k-means clustering vs. k-means to produce equal-sized clusters leads to bad results here, while EM benefits from the Gaussian distributions with different radius present in the data set.[11]
26. k-means clustering is rather easy to apply to even large data sets, particularly when using heuristics such as Lloyd's algorithm.[11]
27. The basic approach is first to train a k-means clustering representation, using the input training data (which need not be labelled).[11]

## 메타데이터

### Spacy 패턴 목록

• [{'LOWER': 'k'}, {'OP': '*'}, {'LOWER': 'means'}, {'LEMMA': 'clustering'}]