学习了Isomap算法后,实现的代码,有不对的地方,请指正
#!/usr/bin/env python 3.7
# coding: utf-8
# In[1]:
import numpy as np
from scipy.spatial.distance import pdist, squareform
import matplotlib.pyplot as plt
'''
myIsomap 2019.11.12
Author: 豆奶
Reference:
Zhihua Zhou. Machine learning[M]. Tsinghua University Press, 2016
实现了Isomap,使用的是k近邻,Floyd算法
总结:
首先用sklearn生成100个散点的S形状的数据来进行测试,得到效果图,与sklearn中的Isomap进行对比
'''
def myMDS(D, d):
#dist = pdist(D, 'euclidean')
#dist = squareform(dist) # 转化为方阵
#dist2 = dist**2
dist2 = D**2 # dist2 = [dist^2]
m = dist2.shape[0]
disti2 = 1/m*dist2.sum(axis=1, keepdims=True) # (m, 1)
distj2 = 1/m*dist2.sum(axis=0, keepdims=True) # (1, m)
distij2 = 1/(m**2)*dist2.sum() # (1, 1)
B = np.zeros((m,m))
for i in range(m):
for j in range(m):
B[i][j] = -0.5*(dist2[i][j]-disti2[i][0]-distj2[0][j]+distij2)
A, U = np.linalg.eig(B)