From 6882c797115e1d2b42fcba12361bc624a9bf1118 Mon Sep 17 00:00:00 2001
From: facat <dugg@21cn.com>
Date: Sun, 7 Dec 2014 00:39:00 +0800
Subject: [PATCH] =?UTF-8?q?=E7=AC=AC=E4=B8=80=E6=AC=A1=E6=8F=90=E4=BA=A4?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Signed-off-by: facat <dugg@21cn.com>
---
 .gitignore |  1 +
 main.m     | 36 ++++++++++++++++++++++++++++++++++++
 2 files changed, 37 insertions(+)
 create mode 100644 .gitignore
 create mode 100644 main.m

diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..21229f7
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1 @@
+*.asv
\ No newline at end of file
diff --git a/main.m b/main.m
new file mode 100644
index 0000000..036d2b7
--- /dev/null
+++ b/main.m
@@ -0,0 +1,36 @@
+clc
+clear
+close all
+%先形成初始点
+center=[1,1,1,1,1;10,10,10,10,10;100,100,100,100,100;1000,1000,1000,1000,1000];
+dataN=100;% 生成多少个数据
+data=zeros(5,dataN);
+for I=1:dataN
+    i=round(1+(5-1)*rand());
+    data(:,I)=center(i)*( -1+(1+1)*rand(5,1));
+end
+
+%选一个候选数据
+cddtI=10;
+SetS=[];
+SetS=[SetS;cddtI;];
+Cij=0;
+for I=1:dataN
+    if I==cddtI
+        continue
+    end
+    d=data(:,I);
+    %寻找最短距离
+    minD=1e20;
+    for J=1:length(SetS)
+        if I==SetS(J)
+            continue
+        end
+        distance=sum((d-data(:,SetS(J))).^2).^.5;
+        if distance<minD
+            minD=distance;
+        end
+    end
+    distanceIJ=sum((d-data(:,cddtI)).^2).^.5;
+    Cij=Cij+max([minD-distanceIJ,0])
+end
\ No newline at end of file