검색어 입력폼

[공학기술]Clustering(k-means)

저작시기 2007.05 |등록일 2007.07.10 파워포인트파일MS 파워포인트 (ppt) | 17페이지 | 가격 1,900원

소개글

Clustering(k-means)에 관한 발표 잘료 입니다. 참고하세요.

목차

Introduction
Hierarchical Clustering
Agglomerative Clustering Algorithm
The Single-Linkage Algorithm
The Complete-Linkage Algorithm
The Average-Linkage Algorithm
Ward’s Method
Partitional Clustering
Forgy’s Algorithm
The k-means Algorithm

본문내용

The single-linkage algorithm
It is called minimum method and the nearest neighbor method.

The distance between two clusters to be the smallest distance between two points such that one point is in each cluster.

If and are clusters, the distance between them is defined as

참고 자료

없음
다운로드 맨위로