Introduction to statistical pattern recognition (2nd ed.)
Introduction to statistical pattern recognition (2nd ed.)
Kernel PCA and de-noising in feature spaces
Proceedings of the 1998 conference on Advances in neural information processing systems II
3PRS: a personalized popular program recommendation system for digital TV for P2P social networks
Multimedia Tools and Applications
CPRS: A cloud-based program recommendation system for digital TV platforms
Future Generation Computer Systems
CPRS: a cloud-based program recommendation system for digital TV platforms
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
| Hi-index | 0.00 |
Over the years, many dimensionality reduction algorithms have been proposed for learning the structure of high dimensional data by linearly or non-linearly transforming it into a low-dimensional space. Some techniques can keep the local structure of data, while the others try to preserve the global structure. In this paper, we propose a linear dimensionality reduction technique that characterizes the local and global properties of data by firstly applying k-means algorithm on original data, and then finding the projection by simultaneously globally maximizing the between-cluster scatter matrix and locally minimizing the within-cluster scatter matrix, which actually keeps both local and global structure of data. Low complexity and structure preserving are two main advantages of the proposed technique. The experiments on both artificial and real data sets show the effectiveness and novelty of proposed algorithm in visualization and classification tasks.