Download
1 / 3
30 likes | 191 Views
TRAIN. Y_TRAIN. X. X_TRAIN: 114*2. D=cross_distance(X,centers) H=exp(-D/200)*a Y_HAT=H>0.5. centers=my_kmeans[X_TRAIN,3,]. D=cross_distance(X_TRAIN,centers). a=pinv(exp(-D))*Y_TRAIN. Y_HAT. TEST. X. D= cross_distance ( X,centers ). centers. H=exp(-D/200)*a). a. Y_HAT=H>0.5. Y_HAT.
E N D
TRAIN Y_TRAIN X X_TRAIN: 114*2 D=cross_distance(X,centers) H=exp(-D/200)*a Y_HAT=H>0.5 centers=my_kmeans[X_TRAIN,3,] D=cross_distance(X_TRAIN,centers) a=pinv(exp(-D))*Y_TRAIN Y_HAT
TEST X D=cross_distance(X,centers) centers H=exp(-D/200)*a) a Y_HAT=H>0.5 Y_HAT
軟作期末考內容 • While loop • 整數根 • 二進位 十進位 • 求根(binary search) • Recursive program • 階乘 • Hanoi • Fibonacci • Determinant • K-means method • Classification • Function approximation • 河內塔 • 填充式
