Advertisement

Revisit to the Problem of Generalized Low Rank Approximation of Matrices

  • Chong Lu
  • Wanquan Liu
  • Senjian An
Chapter
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 345)

Abstract

In this paper, we will revisit the problem of generalized low rank approximation of matrices (GLRM) recently proposed in [1.]. The GLRM problem has been investigated by many researchers in the last two years due to its broad engineering applications. However, it is known that there may be no closed-form solution for this problem and the convergence for the proposed iterative algorithm Algorithm GLRAM is actually still open. Motivated by these observations, we will derive a necessary condition for the GLRAM problem via manifold theory in this paper. Further, the relationship between this derived necessary condition and the Algorithm GLRAM is investigated, which will provide some insights for the possible complete analysis of the convergence problem in the future. Finally, some illustrative examples are presented to show different cases for convergence and divergence with different initial conditions.

Keywords

Singular Value Decomposition Vector Space Model Convergence Issue Manifold Theory Intelligent Information Retrieval 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Jieping, Ye.:Generalized Low Rank Approximations of Matrices, The Proceedings of Twenty-first International Conference on Machine Learning, Banff, Alberta, Canada (2004) 887–894Google Scholar
  2. 2.
    Hua, Y., Wanquan Liu.: Generalized Karhunen-Loeve Transform, IEEE Signal Processing Letters, vol. 5, no. 6, June (1998) 141–142CrossRefGoogle Scholar
  3. 3.
    van der Veen, A.J.:A Schur Method for Low-rank Matrix Approximation, SIAM J. Matrix Anal. Appl, Jan (1996) 139–160Google Scholar
  4. 4.
    Gotze, J., van der Veen, A.J.: On-line Subspace Estimation Using a Schur-type Method,” IEEE Trans. Signal Processing, 44(6) June (1996) 1585–1589CrossRefGoogle Scholar
  5. 5.
    Senjian An, Wanquan Liu, Svetha Venkatesh, Ronny Tjahyadi.: A Fast Dimension Reduction Algorithm for Kernel Based Classification, Proceedings of International Conference 9 on Machine Learning and Cybernetics 2005 18–21 August, Guangzhou, China (2005) 3369–3376Google Scholar
  6. 6.
    Srebro, N., Jaakkola, T.: Weighted Low-rank Approximations. In ICML Conference Proceedings (2003) 720–727Google Scholar
  7. 7.
    Turk, M., Pentland, A.:Eigenfaces for Recognition. Journal of Cognitive Neuroscience, 13(1) (1991) 71–86CrossRefGoogle Scholar
  8. 8.
    Castelli, V., Thomasian, A., Li, C.-S.:CSVD: Clustering and Singular Value Decomposition for Approximate Similarity Searches in High Dimensional Space. IEEE Transactions on Knowledge and Data Engineering (2003) 671–685Google Scholar
  9. 9.
    Berry, M., Dumais, S., OBrie, G.: Using Linear Algebra for Intelligent Information Retrieval. SIAM Review, 37 (1995) 573–595zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Yang, J., Zhang, D., Frangi, A., Yang, J.: Two-dimensional PCA: A New Approach to Appearance-based Face Representation and Recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence (2004) 131–137Google Scholar
  11. 11.
    Golub, G. H., Van Loan, C. F.: Matrix Computations, 3rd edition. Baltimore, MD, USA: The Johns Hopkins University Press (1996)zbMATHGoogle Scholar
  12. 12.
    Brand, M.: Incremental Singular Value Decomposition of Uncertain Data with Missing Values. In ECCV Conference Proceedings (2002) 707–720Google Scholar
  13. 13.
    Kanth, K. V. R., Agrawal, D., Abbadi, A. E., Singh, A.: Dimensionality Reduction for Similarity Searching in Dynamic Databases. In ACM SIGMOD Conference Proceedings (1998) 166–176Google Scholar
  14. 14.
    Wang, L., Wang, X., Zhang, X., Feng, J.: Equivalence of Two Dimensional PCA to Line-based PCA, Pattern recognition Letters (2005) 57–60Google Scholar
  15. 15.
    Helmke, U., JB Moore.: Optimization and Dynamic Systems, Springer, London (1994)Google Scholar
  16. 16.
    Yan, W.Y., Lam, J.: An Approximation Approach to H2 Optimal Model Reduction, IEEE Transaction on Automatic Control (1999) 1341–1358Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Chong Lu
    • 1
    • 2
  • Wanquan Liu
    • 2
  • Senjian An
    • 2
  1. 1.Department of Computer ScienceYiLi Normal CollegeYiningPR China
  2. 2.Department of ComputingCurtin University of TechnologyAustralia

Personalised recommendations