1 / 3

TRAIN

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.

dixie
Télécharger la présentation

TRAIN

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 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

  2. TEST X D=cross_distance(X,centers) centers H=exp(-D/200)*a) a Y_HAT=H>0.5 Y_HAT

  3. 軟作期末考內容 • While loop • 整數根 • 二進位 十進位 • 求根(binary search) • Recursive program • 階乘 • Hanoi • Fibonacci • Determinant • K-means method • Classification • Function approximation • 河內塔 • 填充式

More Related