Efficient Data Representation Combining with ELM and GNMF
Nonnegative Matrix Factorization (NMF) is a powerful data representation method, which has been applied in many applications such as dimension reduction, data clustering etc. As the process of NMF needs huge computation cost, especially when the dimensional of data is large. Thus a ELM feature mapping based NMF is proposed , which combined Extreme Learning Machine (ELM) feature mapping with NMF (EFM NMF), can reduce the computational of NMF. However, the random parameter generating based ELM feature mapping is nonlinear. And this will lower the representation ability of the subspace generated by NMF without sufficiently constrains. In order to solve this problem, this chapter propose a novel method named Extreme Learning Machine feature mapping based graph regulated NMF (EFM GNMF), which combines ELM feature mapping with Graph Regularized Nonnegative Matrix Factorization (GNMF). Experiments on the COIL20 image library, the CMU PIE face database and TDT2 corpus show the efficiency of the proposed method.
KeywordsExtreme learning machine ELM feature mapping Nonnegative matrix factorization Graph regularized nonnegative matrix factorization EFM NMF EFM GNMF Data representation
We want to thank Dr. Huang Guangbin from NTU and Dr. Jin Xin from Chinese Academy of Sciences. They provide us with some codes and details of Extreme Learning Machine. This work was supported by the National Natural Science Foundation Project of China (61173123) and the Natural Science Foundation Project of Zhejiang Province (LR13F030003).
- 1.Q. He, X. Jin, C. Du, F. Zhuang, and Z. Shi, Clustering in extreme learning machine feature space, Neurocomputing (2013)Google Scholar
- 3.S. B, S. L, Nonnegative matrix factorization clustering on multiple manifolds, in AAAI (2010)Google Scholar
- 4.S. Li, X. Hou, H. Zhang, Q. Cheng, Learning spatially localized, parts-based representation, Computer Vision and Pattern Recognition, 2001. CVPR 2001. in Proceedings of the 2001 IEEE Computer Society Conference, vol. 1, pp. 207–212, 2001Google Scholar
- 5.W. Xu, X. Liu, Y. Gong, Document clustering based on non-negative matrix factorization, in Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval, pp. 267–273, 2003Google Scholar
- 7.G.-B. Huang, L. Chen, A generalized growing and pruning RBF (GGAP-RBF) neural network for function approximation. IEEE Trans. Neural Networks 71, 3460–3468 (2008)Google Scholar
- 8.Q. Liu, Q. He, and Z. Shi, Extreme support vector machine classifer, in Knowledge Discovery and Data Mining (Springer, Berlin, 2008), pp. 222–233Google Scholar
- 10.N. X, Locality preserving projections. Neural Inf. proc. syst. 16, 153 (2004)Google Scholar
- 11.D. Cai, X. He, J. Han, Graph regularized nonnegative matrix factorization for data representation. IEEE Trans. Pattern Anal. Mach. Intell. 33(8), 1548–1560 (2011)Google Scholar
- 14.G.-B. Huang, L. Chen, C.-K. Siew, Universal approximation using incremental constructive feedforward networks with random hidden nodes. IEEE Trans. Neural Networks 17(4), 879–892 (2006)Google Scholar
- 18.W. Y and Z. Y., “Non-negative matrix factorization: a comprehensive review”, Pattern Recognition, vol. 1, no. 1, 2011.Google Scholar