计算机应用研究
計算機應用研究
계산궤응용연구
APPLICATION RESEARCH OF COMPUTERS
2013年
3期
728-731
,共4页
流形学习%数据降维%局部切空间排列%切空间%协方差矩阵
流形學習%數據降維%跼部切空間排列%切空間%協方差矩陣
류형학습%수거강유%국부절공간배렬%절공간%협방차구진
manifold learning%data reduction%local tangent space alignment(LTSA)%tangent spaces%covariance matrix
局部切空间排列(LTSA)算法是一种有效的流形学习算法, 能较好地学习出高维数据的低维嵌入坐标。数据点的切空间在LTSA算法中起着重要的作用, 其局部几何特征多是在样本点的切空间内表示。但是在实际中, LTSA算法是把数据点邻域的样本协方差矩阵的主元所张成的空间当做数据点的切空间, 导致了在非均匀采样或样本邻域均值点与样本自身偏离程度较大时, 原算法的误差增大, 甚至失效。为此, 提出一种更严谨的数据点切空间的计算方法, 即数据点的邻域矩阵按照数据点本身进行中心化。通过数学推导, 证明了在一阶泰勒展开的近似下, 提出的计算方法所得到的空间即为数据点自身的切空间。在此基础上, 提出了一种改进的局部切空间排列算法, 并通过实验结果体现了该方法的有效性和稳定性。与已有经典算法相比, 提出的计算方法没有增加任何计算复杂度。
跼部切空間排列(LTSA)算法是一種有效的流形學習算法, 能較好地學習齣高維數據的低維嵌入坐標。數據點的切空間在LTSA算法中起著重要的作用, 其跼部幾何特徵多是在樣本點的切空間內錶示。但是在實際中, LTSA算法是把數據點鄰域的樣本協方差矩陣的主元所張成的空間噹做數據點的切空間, 導緻瞭在非均勻採樣或樣本鄰域均值點與樣本自身偏離程度較大時, 原算法的誤差增大, 甚至失效。為此, 提齣一種更嚴謹的數據點切空間的計算方法, 即數據點的鄰域矩陣按照數據點本身進行中心化。通過數學推導, 證明瞭在一階泰勒展開的近似下, 提齣的計算方法所得到的空間即為數據點自身的切空間。在此基礎上, 提齣瞭一種改進的跼部切空間排列算法, 併通過實驗結果體現瞭該方法的有效性和穩定性。與已有經典算法相比, 提齣的計算方法沒有增加任何計算複雜度。
국부절공간배렬(LTSA)산법시일충유효적류형학습산법, 능교호지학습출고유수거적저유감입좌표。수거점적절공간재LTSA산법중기착중요적작용, 기국부궤하특정다시재양본점적절공간내표시。단시재실제중, LTSA산법시파수거점린역적양본협방차구진적주원소장성적공간당주수거점적절공간, 도치료재비균균채양혹양본린역균치점여양본자신편리정도교대시, 원산법적오차증대, 심지실효。위차, 제출일충경엄근적수거점절공간적계산방법, 즉수거점적린역구진안조수거점본신진행중심화。통과수학추도, 증명료재일계태륵전개적근사하, 제출적계산방법소득도적공간즉위수거점자신적절공간。재차기출상, 제출료일충개진적국부절공간배렬산법, 병통과실험결과체현료해방법적유효성화은정성。여이유경전산법상비, 제출적계산방법몰유증가임하계산복잡도。
As one of the classical manifold learning algorithms, LTSA algorithm can yield low-dimensional embedding coordinates from high-dimensional space effectively. Tangent space plays a central role in LTSA algorithm by projecting each neighborhood into the tangent space to obtain the local coordinates. However, in practice, LTSA algorithm takes the space which spanned by principal components of the sample covariance matrix of the neighborhood as the tangent space of the point. This paper presented a more rigorous method to calculate tangent space, that the neighborhood matrix of data points was centralized in accordance with the data point itself. By mathematical deduction, it proved that, under the approximation of first order Taylor, the space attained by our method is even the tangent space of data points itself. Based on this method, it proposed an improved local tangent space alignment algorithm. The effectiveness and stability of this algorithm are further confirmed by some experiments. Moreover, the proposed algorithm has no increase in the computational complexity.