文件名称:kmedian
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
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