Nonnegativity Constraints in Numerical Analysis - CiteSeer

More documents

Recommendations

Info

$Math 733: Vector Fields, Differential Forms, and Cohomology$

References[1] S. Bellavia, M. Macconi, and B. Morini, An interior point newton-like method for nonnegativeleast squares problems with degenerate solution, Numerical Linear Algebra withApplications, 13, pp. 825–846, 2006.[2] J. R. Bellegarda, A multispan language modelling framework for large vocabulary speechrecognition, IEEE Transactions on Speech and Audio Processing, September 1998, Vol.6, No. 5, pp. 456–467.[3] P. Belhumeur, J. Hespanha, and D. Kriegman, Eigenfaces vs. Fisherfaces: RecognitionUsing Class Specific Linear Projection, IEEE PAMI, Vol. 19, No. 7, 1997.[4] M. H. van Benthem, M. R. Keenan, Fast algorithm for the solution of large-scale nonnegativityconstrained least squares problems, Journal of Chemometrics, Vol. 18, pp.441-450, 2004.[5] M. S. Bartlett, J. R. Movellan, and T. J. Sejnowski, Face recognition by independentcomponent analysis, IEEE Trans. Neural Networks, Vol. 13, No. 6, pp. 1450–1464, 2002.[6] R. B. Bapat, T. E. S. Raghavan, Nonnegative Matrices and Applications, CambridgeUniversity Press, UK, 1997.[7] A. Berman and R. Plemmons, Rank factorizations of nonnegative matrices, Problemsand Solutions, 73-14 (Problem), SIAM Rev., Vol. 15:655, 1973.[8] A. Berman, R. Plemmons, Nonnegative Matrices in the Mathematical Sciences, AcademicPress, NY, 1979. Revised version in SIAM Classics in Applied Mathematics,Philadelphia, 1994.[9] M. Berry, M Browne, A. Langville, P Pauca, and R. Plemmons, Algorithmsand applications for approximate nonnegative matrix factorization, ComputationalStatistics and Data Analysis, Vol. 52, pp. 155-173, 2007. Preprint available athttp://www.wfu.edu/∼plemmons[10] M. W. Berry, Computational Information Retrieval, SIAM, Philadelphia, 2000.[11] D. Bertsekas, Nonlinear Programming, Athena Scientific, Belmont, MA.[12] M. Bierlaire, Ph. L. Toint, and D. Tuyttens, On iterative algorithms for linear leastsquares problems with bound constraints, Linear Algebra and its Applications, Vol. 143,pp. 111-143, 1991.[13] B. Boser, I. Guyon, and V. Vapnik, A training algorithm for optimal margin classifiers,Fifth Annual Workshop on Computational Learning Theory, ACM Press, 1992.[14] D. S. Briggs, High fidelity deconvolution of moderately resolved radio sources, Ph.D.thesis, New Mexico Inst. of Mining & Technology, 1995.26
[15] R. Bro, S. D. Jong, A fast non-negativity-constrained least squares algorithm, Journalof Chemometrics, Vol. 11, No. 5, pp. 393-401, 1997.[16] M. Catral, L. Han, M. Neumann, and R.Plemmons, On reduced rank nonnegative matrixfactorization for symmetric nonnegative matrices, Lin. Alg. Appl., 393:107–126, 2004.[17] J. Cantarella, M. Piatek, Tsnnls: A solver for large sparse least squares problems withnon-negative variables, ArXiv Computer Science e-prints, 2004.[18] R.Chellappa, C. Wilson, and S. Sirohey, Human and Machine Recognition of Faces: ASurvey, Proc, IEEE, Vol. 83, No. 5, pp. 705–740, 1995.[19] X. Chen, L. Gu, S. Z. Li, and H. J. Zhang, Learning representative local features forface detection, IEEE Conference on Computer Vision and Pattern Recognition, Vol.1,pp. 1126–1131, 2001.[20] M. T. Chu, F. Diele, R. Plemmons, S. Ragni, Optimality, computation,and interpretation of nonnegative matrix factorizations, preprint. Available at:http://www.wfu.edu/∼plemmons[21] M. Chu and R.J. Plemmons, Nonnegative matrix factorization and applications, Appearedin IMAGE, Bulletin of the International Linear Algebra Society, Vol. 34, pp.2-7, July 2005. Available at: http://www.wfu.edu/∼plemmons[22] I. B. Ciocoiu, H. N. Costin, Localized versus locality-preserving subspace projectionsfor face recognition, EURASIP Journal on Image and Video Processing Volume 2007,Article ID 17173.[23] C. Cortes, V. Vapnik, Support Vector networks, Machine Learning, Vol. 20, pp. 273 -297, 1995.[24] A. Dax, On computational aspects of bounded linear least squares problems, ACM Trans.Math. Softw. Vol. 17, pp. 64-73, 1991.[25] I. S. Dhillon, D. M. Modha, Concept decompositions for large sparse text data usingclustering, Machine Learning J., Vol. 42, pp. 143–175, 2001.[26] C. Ding and X. He, and H. Simon, On the equivalence of nonnegative matrix factorizationand spectral clustering, Proceedings of the Fifth SIAM International Conference onData Mining, Newport Beach, CA, 2005.[27] B. A. Draper, K. Baek, M. S. Bartlett, and J. R. Beveridge, Recognizing faces with PCAand ICA, Computer Vision and Image Understanding, Vol. 91, No. 1, pp. 115–137, 2003.[28] N. K. M. Faber, R. Bro, and P. K. Hopke, Recent developments in CANDE-COMP/PARAFAC algorithms: a critical review, Chemometr. Intell. Lab., Vol. 65, No.1, pp. 119–137, 2003.27
Page 1: Nonnegativity Constraints in Numeri
Page 5: NNLS Problem:Given a matrix A ∈ R
Page 8 and 9: However, when applied in a straight
Page 10 and 11: the active set method fnnls. It als
Page 12 and 13: Block principal pivoting algorithm:
Page 14 and 15: 4.1 Nonnegative Matrix Factorizatio
Page 16 and 17: algorithms can be very fast. The im
Page 18 and 19: Furthermore, the product T (m×np)
Page 20 and 21: 5.2 Image Processing and Computer V
Page 22 and 23: 5.4 Environmetrics and Chemometrics
Page 24 and 25: Figure 3: Artist rendition of a JSA
Page 28 and 29: [29] V. Franc, V. Hlavč, and M. Na
Page 30 and 31: [60] J. G. Nagy, Z. Strakoš, Enfor
Page 32: [89] R. S. Varga, Matrix Iterative

Nonnegativity Constraints in Numerical Analysis - CiteSeer

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?