Dirk wrote:
Hi!
I'm looking for an effective way to store a large document-term matrix.
The matrix I'm looking at has about 100.000 documents and probably
1.000 terms.
Which representation of this matrix would be the most effictive to work
with?
Putting the whole thing into memory at
The Term Document matrix is a perfect example of implementing Sparse matrix memory implementation. I have had examples where I was able to represent a 5000 words cross 50,000 documents (a little more than that), much efficiently using the in-memory representation techniques of sparse memories.
I got the following error when I ran ``ld -e test.o -e f''
where f is a function
--
int f() {
}
--
ld: warning: cannot find entry symbol f; defaulting to 08048094
:D
On 5/20/06, Harender Bisht [EMAIL PROTECTED] wrote:
hi , I do not know you can do it with out assembly language .
