L. MIRSKY, Symmetric gage functions and unitarilly invariant norms, Q. J. Math, 11 (1960), pp. 50--59. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Computational Methods for Intelligent Information Access - Berry, Dumais, al. (1995) (13 citations) (Correct)
....=kA Gamma A k k 2 F =oe 2 k 1 Delta Delta Delta oe 2 p : Proof 2. 2 See [16] In other words, A k , which is constructed from the k largest singular triplets of A, is the closest rank k matrix to A [15] In fact, A k is the best approximation to A for any unitarily invariant norm [22]. Hence, min rank(B) k kA Gamma Bk 2 =kA Gamma A k k 2 =oe k 1 : 3) 2.1 Latent Semantic Indexing In order to implement Latent Semantic Indexing [5, 12] a matrix of terms by documents must be constructed. The elements of the termdocument matrix are the occurrences of each word in a ....
L. MIRSKY, Symmetric gage functions and unitarilly invariant norms, Q. J. Math, 11 (1960), pp. 50--59.
Large Scale Sparse Singular Value Computations - Berry (1992) (23 citations) (Correct)
.... Delta oe 2 p : This important result, which indicates that A k is the best rank k approximation (in a least squares sense) to the matrix A, is the basis for concepts such as data reduction and image enhancement. In fact, A k is the best approximation to A for any unitarily invariant norm ([31]) Hence, min r(B) k kA Gamma Bk 2 = kA Gamma A k k 2 = oe k 1 : In the next section, we illustrate the applicability of Theorem 1.2 to problems in information retrieval and seismic tomography which motivate the sparse SVD problem. In Section 3, we present two Lanczos based methods and two ....
L. Mirsky. Symmetric gage functions and unitarilly invariant norms. Quart.J. Math, 11:50--59, 1960.
Using Linear Algebra for Intelligent Information Retrieval - Berry, Dumais, O'Brien (1995) (183 citations) (Correct)
....Bk 2 F = kA Gamma Akk 2 F = oe 2 k 1 Delta Delta Delta oe 2 p : Proof. See [15] In other words, Ak , which is constructed from the k largest singular triplets of A, is the closest rank k matrix to A [14] In fact, Ak is the best approximation to A for any unitarily invariant norm [21]. Hence, min rank(B) k kA Gamma Bk2 = kA Gamma Akk2 = oe k 1 : 3) 2.1. Latent Semantic Indexing. In order to implement Latent Semantic Indexing [4, 11] a matrix of terms by documents must be constructed. The elements of the term document matrix are the occurrences of each word in a ....
L. Mirsky, Symmetric gage functions and unitarilly invariant norms, Q. J. Math, 11 (1960), pp. 50--59.
SVDPACKC (Version 1.0) User's Guide - Berry, Do, Krishna, Varadhan (1993) (Correct)
....2 p : Applications 5 This important result, which indicates that A k is the best rank k approximation (in a least squares sense) to the matrix A, is the basis for concepts such as data reduction and image enhancement. In fact, A k is the best approximation to A for any unitarily invariant norm ([24]) Hence, min r(B) k kA Gamma Bk 2 = kA Gamma A k k 2 = oe k 1 : In the next section, we illustrate the applicability of Theorem 1.2 to problems in information retrieval which motivated the development of SVDPACKC. In Section 3, we present two pairs of Lanczos based routines, las1, las2) and ....
Mirsky, L. Symmetric gage functions and unitarilly invariant norms. Quarterly Journal of Mathematics 11 (1960), 50--59. REFERENCES 49
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC