Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2018, Article ID 2743678, 12 pages
https://doi.org/10.1155/2018/2743678
Research Article

Graph Sparse Nonnegative Matrix Factorization Algorithm Based on the Inertial Projection Neural Network

1College of Electronic and Information Engineering, Southwest University, Chongqing 400715, China
2College of Mobile Telecommunications, Chongqing University of Posts and Telecommunications, Chongqing 401520, China

Correspondence should be addressed to Chuandong Li; nc.ude.uws@ildc

Received 3 May 2017; Accepted 13 December 2017; Published 19 March 2018

Academic Editor: Pietro De Lellis

Copyright © 2018 Xiangguang Dai et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Agarwal, A. Awan, and D. Roth, “Learning to detect objects in images via a sparse, part-based representation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 11, pp. 1475–1490, 2004. View at Publisher · View at Google Scholar · View at Scopus
  2. S. Deerwester, S. T. Dumais, G. W. Furnas, T. K. Landauer, and R. Harshman, “Indexing by latent semantic analysis,” Journal of the Association for Information Science and Technology, vol. 41, no. 6, pp. 391–407, 1990. View at Google Scholar · View at Scopus
  3. D. D. Lee and H. S. Seung, “Learning the parts of objects by non-negative matrix factorization,” Nature, vol. 401, no. 6755, pp. 788–791, 1999. View at Google Scholar
  4. D. Kalman, “A Singularly Valuable Decomposition: The SVD of a Matrix,” The College Mathematics Journal, vol. 27, no. 1, p. 2, 1996. View at Publisher · View at Google Scholar
  5. I. T. Jolliffe, Principal Component Analysis, Springer Series in Statistics, Springer, New York, NY, USA, 2nd edition, 2002. View at MathSciNet
  6. A. Gersho and R. M. Gray, Vector Quantization and Signal Compression, Springer, Boston, MA, USA, 1992. View at Publisher · View at Google Scholar
  7. A. Cichocki, R. Zdunek, and S.-I. Amari, “New algorithms for non-negative matrix factorization in applications to blind source separation,” in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '06), vol. 5, pp. V621–V624, Toulouse, France, May 2006. View at Publisher · View at Google Scholar · View at Scopus
  8. V. P. Pauca, F. Shahnaz, M. W. Berry, and R. J. Plemmons, “Text mining using non-negative matrix factorizations,” in Proceedings of the 4th SIAM International Conference on Data Mining, pp. 452–456, 2004. View at MathSciNet
  9. W. Xu, X. Liu, and 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 (SIGIR '03), pp. 267–273, Toronto, Canada, August 2003. View at Publisher · View at Google Scholar
  10. P. O. Hoyer, “Non-negative sparse coding,” in Proceedings of the 12th IEEE Workshop on Neural Networks for Signal Processing, pp. 557–565, 2002. View at Publisher · View at Google Scholar
  11. D. Cai, X. He, J. Han, and T. S. Huang, “Graph regularized nonnegative matrix factorization for data representation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 8, pp. 1548–1560, 2011. View at Publisher · View at Google Scholar · View at Scopus
  12. W.-S. Chen, Y. Zhao, B. Pan, and B. Chen, “Supervised kernel nonnegative matrix factorization for face recognition,” Neurocomputing, vol. 205, pp. 165–181, 2016. View at Publisher · View at Google Scholar · View at Scopus
  13. H. Liu, Z. Wu, X. Li, D. Cai, and T. S. Huang, “Constrained nonnegative matrix factorization for image representation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 7, pp. 1299–1311, 2012. View at Publisher · View at Google Scholar · View at Scopus
  14. J. J. Hopfield and D. W. Tank, “Neural computation of decisions in optimization problems,” Biological Cybernetics, vol. 52, no. 3, pp. 141–152, 1985. View at Google Scholar · View at MathSciNet · View at Scopus
  15. Y. Xia, H. Leung, and J. Wang, “A projection neural network and its application to constrained optimization problems,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 49, no. 4, pp. 447–458, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. X. He, T. Huang, J. Yu, and C. Li, “An inertial projection neural network for solving variational inequalities,” IEEE Transactions on Cybernetics, vol. 99, pp. 1–6, 2016. View at Google Scholar
  17. H. Che, C. Li, X. He, and T. Huang, “An intelligent method of swarm neural networks for equalities-constrained nonconvex optimization,” Neurocomputing, vol. 167, pp. 569–577, 2015. View at Publisher · View at Google Scholar · View at Scopus
  18. J. Wang, “Analysis and design of a recurrent neural network for linear programming,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 40, no. 9, pp. 613–618, 1993. View at Publisher · View at Google Scholar · View at Scopus
  19. X. Hu and B. Zhang, “An alternative recurrent neural network for solving variational inequalities and related optimization problems,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 39, no. 6, pp. 1640–1645, 2009. View at Publisher · View at Google Scholar · View at Scopus
  20. X. Hu and J. Wang, “A recurrent neural network for solving a class of general variational inequalities,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 37, no. 3, pp. 528–539, 2007. View at Publisher · View at Google Scholar · View at Scopus
  21. X. Hu and J. Wang, “Design of general projection neural networks for solving monotone linear variational inequalities and linear and quadratic optimization problems,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 37, no. 5, pp. 1414–1421, 2007. View at Publisher · View at Google Scholar · View at Scopus
  22. Z. Yan, J. Wang, and G. Li, “A collective neurodynamic optimization approach to bound-constrained nonconvex optimization,” Neural Networks, vol. 55, pp. 20–29, 2014. View at Publisher · View at Google Scholar · View at Scopus
  23. Q. Liu and J. Wang, “A one-layer recurrent neural network with a discontinuous hard-limiting activation function for quadratic programming,” IEEE Transactions on Neural Networks and Learning Systems, vol. 19, no. 4, pp. 558–570, 2008. View at Publisher · View at Google Scholar · View at Scopus
  24. J. Fan and J. Wang, “A collective neurodynamic optimization approach to nonnegative matrix factorization,” IEEE Transactions on Neural Networks and Learning Systems, vol. 28, no. 10, pp. 2344–2356, 2017. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. Z. Yan and J. Wang, “Nonlinear model predictive control based on collective neurodynamic optimization,” IEEE Transactions on Neural Networks and Learning Systems, vol. 26, no. 4, pp. 840–850, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. J. Shi, X. Ren, G. Dai, J. Wang, and Z. Zhang, “A non-convex relaxation approach to sparse dictionary learning,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR '11), pp. 1809–1816, June 2011. View at Publisher · View at Google Scholar · View at Scopus
  27. G. Li, Z. Yan, and J. Wang, “A one-layer recurrent neural network for constrained nonconvex optimization,” Neural Networks, vol. 61, pp. 10–21, 2015. View at Publisher · View at Google Scholar · View at Scopus
  28. H. Lee, A. Battle, R. Raina, and A. Ng, “Efficient sparse coding algorithms,” in Proceedings of the International Conference on Neural Information Processing Systems, pp. 801–808, 2006.
  29. D. Cai, H. Bao, and X. He, “Sparse concept coding for visual analysis,” in Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2011, pp. 2905–2910, USA, June 2011. View at Publisher · View at Google Scholar · View at Scopus
  30. B. A. Olshausen and D. J. Field, “Emergence of simple-cell receptive field properties by learning a sparse code for natural images,” Nature, vol. 381, no. 6583, pp. 607–609, 1996. View at Publisher · View at Google Scholar · View at Scopus
  31. P. Tseng, “Convergence of a block coordinate descent method for nondifferentiable minimization,” Journal of Optimization Theory and Applications, vol. 109, no. 3, pp. 475–494, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. M. A. T. Figueiredo, R. D. Nowak, and S. J. Wright, “Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems,” IEEE Journal of Selected Topics in Signal Processing, vol. 1, no. 4, pp. 586–597, 2007. View at Publisher · View at Google Scholar · View at Scopus
  33. D. Cai, X. He, and J. Han, “Document clustering using locality preserving indexing,” IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 12, pp. 1624–1637, 2005. View at Publisher · View at Google Scholar · View at Scopus