文件名称:kmedian
介绍说明--下载内容来自于网络,使用问题请自行百度
The method works as follows.
1. For a data set with dimensionality, d, compute the variance
of data in each dimension (column).
2. Find the column with maximum variance call it cvmax
and sort it in any order.
3. Divide the data points of cvmax into K subsets, where K is
the desired number of clusters.
4. Find the median of each subset.
5. Use the corresponding data points (vectors) for each
median to initialize the cluster centers.-The method works as follows.
1. For a data set with dimensionality, d, compute the variance
of data in each dimension (column).
2. Find the column with maximum variance call it cvmax
and sort it in any order.
3. Divide the data points of cvmax into K subsets, where K is
the desired number of clusters.
4. Find the median of each subset.
5. Use the corresponding data points (vectors) for each
median to initialize the cluster centers.
1. For a data set with dimensionality, d, compute the variance
of data in each dimension (column).
2. Find the column with maximum variance call it cvmax
and sort it in any order.
3. Divide the data points of cvmax into K subsets, where K is
the desired number of clusters.
4. Find the median of each subset.
5. Use the corresponding data points (vectors) for each
median to initialize the cluster centers.-The method works as follows.
1. For a data set with dimensionality, d, compute the variance
of data in each dimension (column).
2. Find the column with maximum variance call it cvmax
and sort it in any order.
3. Divide the data points of cvmax into K subsets, where K is
the desired number of clusters.
4. Find the median of each subset.
5. Use the corresponding data points (vectors) for each
median to initialize the cluster centers.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
movement.m
Untitled3.m
Untitled3.m
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.