vq2.out

自适应矢量化算法（VQ）源程序VQ

The input patterns are:
Pattern[0][0]=0.000000
Pattern[0][1]=0.000000
Pattern[1][0]=1.000000
Pattern[1][1]=0.000000
Pattern[2][0]=0.000000
Pattern[2][1]=1.000000
Pattern[3][0]=1.000000
Pattern[3][1]=1.000000
Pattern[4][0]=0.000000
Pattern[4][1]=3.000000
Pattern[5][0]=1.000000
Pattern[5][1]=3.000000
Pattern[6][0]=0.000000
Pattern[6][1]=4.000000
Pattern[7][0]=1.000000
Pattern[7][1]=4.000000
Pattern[8][0]=4.000000
Pattern[8][1]=0.000000
Pattern[9][0]=5.000000
Pattern[9][1]=0.000000
Pattern[10][0]=4.000000
Pattern[10][1]=1.000000
Pattern[11][0]=5.000000
Pattern[11][1]=1.000000



PATTERN 0:
No Clusters exist  so allocate a new cluster 0
patern 0 assigned to cluster 0

The new cluster centers are:
CLUSTER 0 ==>[0.000000,0.000000]
CLUSTER Membership
  Cluster 0 ==>{0 }


PATTERN 1:
The closest cluster is: 0
Distance 1.000000 < 3.500000
Therefore cluster 0 passed the distance test.
patern 1 assigned to cluster 0

The new cluster centers are:
CLUSTER 0 ==>[0.500000,0.000000]
CLUSTER Membership
  Cluster 0 ==>{0 1 }


PATTERN 2:
The closest cluster is: 0
Distance 1.118034 < 3.500000
Therefore cluster 0 passed the distance test.
patern 2 assigned to cluster 0

The new cluster centers are:
CLUSTER 0 ==>[0.333333,0.333333]
CLUSTER Membership
  Cluster 0 ==>{0 1 2 }


PATTERN 3:
The closest cluster is: 0
Distance 0.942809 < 3.500000
Therefore cluster 0 passed the distance test.
patern 3 assigned to cluster 0

The new cluster centers are:
CLUSTER 0 ==>[0.500000,0.500000]
CLUSTER Membership
  Cluster 0 ==>{0 1 2 3 }


PATTERN 4:
The closest cluster is: 0
Distance 2.549510 < 3.500000
Therefore cluster 0 passed the distance test.
patern 4 assigned to cluster 0

The new cluster centers are:
CLUSTER 0 ==>[0.400000,1.000000]
CLUSTER Membership
  Cluster 0 ==>{0 1 2 3 4 }


PATTERN 5:
The closest cluster is: 0
Distance 2.088061 < 3.500000
Therefore cluster 0 passed the distance test.
patern 5 assigned to cluster 0

The new cluster centers are:
CLUSTER 0 ==>[0.500000,1.333333]
CLUSTER Membership
  Cluster 0 ==>{0 1 2 3 4 5 }


PATTERN 6:
The closest cluster is: 0
Distance 2.713137 < 3.500000
Therefore cluster 0 passed the distance test.
patern 6 assigned to cluster 0

The new cluster centers are:
CLUSTER 0 ==>[0.428571,1.714286]
CLUSTER Membership
  Cluster 0 ==>{0 1 2 3 4 5 6 }


PATTERN 7:
The closest cluster is: 0
Distance 2.356060 < 3.500000
Therefore cluster 0 passed the distance test.
patern 7 assigned to cluster 0

The new cluster centers are:
CLUSTER 0 ==>[0.500000,2.000000]
CLUSTER Membership
  Cluster 0 ==>{0 1 2 3 4 5 6 7 }


PATTERN 8:
The closest cluster is: 0
distance 4.031129 > 3.500000
Therefore cluster 0 failed the distance test.
so create NEW cluster number:1
patern 8 assigned to cluster 1

The new cluster centers are:
CLUSTER 0 ==>[0.500000,2.000000]
CLUSTER 1 ==>[4.000000,0.000000]
CLUSTER Membership
  Cluster 0 ==>{0 1 2 3 4 5 6 7 }

  Cluster 1 ==>{8 }


PATTERN 9:
The closest cluster is: 1
Distance 1.000000 < 3.500000
Therefore cluster 1 passed the distance test.
patern 9 assigned to cluster 1

The new cluster centers are:
CLUSTER 0 ==>[0.500000,2.000000]
CLUSTER 1 ==>[4.500000,0.000000]
CLUSTER Membership
  Cluster 0 ==>{0 1 2 3 4 5 6 7 }

  Cluster 1 ==>{8 9 }


PATTERN 10:
The closest cluster is: 1
Distance 1.118034 < 3.500000
Therefore cluster 1 passed the distance test.
patern 10 assigned to cluster 1

The new cluster centers are:
CLUSTER 0 ==>[0.500000,2.000000]
CLUSTER 1 ==>[4.333333,0.333333]
CLUSTER Membership
  Cluster 0 ==>{0 1 2 3 4 5 6 7 }

  Cluster 1 ==>{8 9 10 }


PATTERN 11:
The closest cluster is: 1
Distance 0.942809 < 3.500000
Therefore cluster 1 passed the distance test.
patern 11 assigned to cluster 1

The new cluster centers are:
CLUSTER 0 ==>[0.500000,2.000000]
CLUSTER 1 ==>[4.500000,0.500000]
CLUSTER Membership
  Cluster 0 ==>{0 1 2 3 4 5 6 7 }

  Cluster 1 ==>{8 9 10 11 }