|
Re: Request for help concerning a LSA problem: msg#00035science.linguistics.corpora
Cecilie Desiree Widsteen wrote: Hello all, This isn't a problem!!! This is the content of fn. 2 on p.561 of anything-other-than-early printings of FSNLP: For any given SVD solution, you can get additional non-identical ones by flipping signs in corresponding left and right singular vectors of $T$ and $D$, and, if there are two or more identical singular values, then the subspace determined by the corresponding singular vectors is unique, but can be described by any appropriate orthonormal basis vectors. But, apart from these cases, \acro{SVD} is unique. The minuses cancel out and so don't effect the solution. But, beyond that, I think you will find that you will have trouble doing anything 'large scale' (i.e., text collections with vocabularies of 20,000 words or things like that) using Jama, because it only supports dense SVD calculations (that is, using 20,000x20,000 matrices, which require a lot of RAM). For text applications, it's usual to use something that supports doing SVD on sparse matrices, like the classic SVDpack, Matlab, or, if you're using Java, you might try MTJ: http://rs.cipr.uib.no/mtj/ Chris. As far as I can understand, this means that my vectors are pointing in |
|
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| Previous by Date: | RE: Request for help concerning a LSA problem: 00035, Evgeniy Gabrilovich |
|---|---|
| Next by Date: | TEXT MINING RESEARCH POSITION AT THE UNIVERSITY OF MANCHESTER: 00035, Ananiadou, Sophia |
| Previous by Thread: | RE: Request for help concerning a LSA problemi: 00035, Evgeniy Gabrilovich |
| Next by Thread: | Re: Request for help concerning a LSA problem: 00035, Nitin Madnani |
| Indexes: | [Date] [Thread] [Top] [All Lists] |
| News | FAQ | advertise |