Low Rank Radial Smoothing using GLIMMIX , a semiparametric approach to smooth curves . Specifying TYPE=RSMOOTH option in RANDOM statement, we can implement this spline smooth approach. The bast thing is that for future scoring, data preparation...
Read more »
In the 2010 SASware Ballot®, a dedicated PROC for Randomized SVD was among the options. While an official SAS PROC will not be available in the immediate future as well as in older SAS releases, it is fairly simple to implement this algorithm using ...
Read more »
In some data mining applications, matrix norm has to be calculated, for instance . You can find a detailed explanation of Matrix Norm on Wiki @ Here
Instead of user written routine in DATA STEP, we can obtain "Entrywise" norm via PROC FASTCLUS ef...
Read more »
SVD is at the heart of many modern machine learning algorithms. As a computing vehicle for PCA, SVD can be obtained using PROC PRINCOMP on the covariance matrix of a given matrix withou correction for intercept. With SVD, we are ready to ca...
Read more »
Gap statistic is a method used to estimate the most possible number of clusters in a partition clustering, noticeablly k-means clustering. This measurement was originated by Trevor Hastie, Robert Tibshirani, and Guenther Walther, all from Standford U...
Read more »
In this example, we show the a clustering exercise on Optical Recognition of Handwritten Digits Data Set available @ UCI data set repository (Link).
This exercise is a standard application of HOSVD by stacking 8X8 matrix of digitalized&nbs...
Read more »
Tensor, a math concept for high order array, is a very useful tool in modern data mining applications. HOSVD, the counter part of SVD in higher order array, is at the heart of modern applications, such as face recognition and clustering, segmentation...
Read more »