Talk:Document-term matrix: Difference between revisions

Revision as of 12:14, 21 July 2005

Revision as of 12:37, 21 July 2005

Line 11:

: Not necessarily: what you say is one valid interpretation of the reduction, but the reduction can also be interpreted as creating a "better" matrix, since the operation tends to "soften" the representation and reduce possible noise.

: Also, it's not always true that this makes it easier on the computational side; for instance, LSA is rather ''heavier'' than just just leaving the thing alone (I have a reference for that somewhere, I am just rather busy at the moment...). Hope it helps ! Cheers ! [[User:Rama|Rama]] 12:14, 21 July 2005 (UTC)

:: Yes but LSA is computed once, the important part is having real time answers to ''queries''. Once the matrix is smaller, this will be faster, won't it ? [[User:Kh251|KH251]] 12:37, 21 July 2005 (UTC)