Unitary operators on the document space

Journal of the American Society for Information Science and Technology

Volumn 54, Issue 4, 2003, Pages 314-320

  Hoenkamp, Eduard ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; INDEXING (OF INFORMATION); MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; SEMANTICS;

DOCUMENT SPACE; HAAR TRANSFORM; LATENT SEMANTIC INDEXING;

INFORMATION RETRIEVAL;

EID: 0037294546     PISSN: 15322882     EISSN: None     Source Type: Journal    
DOI: 10.1002/asi.10211     Document Type: Article

References (17)

1. Aizawa, A. (2000). The feature quantity: An information theoretic perspective of tfidf-like measures. In Proceedings of the 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 104-111). New York: ACM Press.
2. Baraniuk, R.G., & Jones, D.L. (1995). Unitary equivalence: A new twist on signal processing. IEEE Transactions on Signal Processing, 43, 2269-2282.
3. Berry, M., & Fierro, R. (1996). Low-rank orthogonal decomposition for information retrieval applications. Numerical Linear Algebra with Applications; 1 (1), 1-27.
4. Berry, M., Dumais, S., & O'Brien, G. (1995). Lowrank orthogonal decompositions for information retrieval applications. SIAM Review, 37(4), 573-559.
5. Coifman, R.R., & Wickerhauser, M.V. (1992). Entropy based algorithms for best basis selection. IEEE Trans. Information Theory, 38(2), 713-718.
6. Daubechies, I. (1992). Ten lectures on wavelets. No 61 in CBMS-NSF Series in Applied Mathematics. Philadelphia: SIAM.
7. Deerwester, S.C., Dumais, S.T., Landauer, T.K., Furnas, G.W., & Harshman, R.A. (1990). Indexing by latent semantic analysis. Journal of the American Society of Information Science, 41 (6), 391-407.
8. Eckart, G., & Young, G. (1936). The approximation of one matrix by another of lower rank, Psychometrika, 1, 211-218.
9. Haar, A. (1910). Zur theoric der orthogonalen funktionen-systeme. Annals of Mathematics, 69, 331-371.
10. Hearst, M.A., & Pedersen, J.O. (1996). Reexamining the cluster hypothesis: Scatter/gather on retrieval results. In Proceedings of SIGIR-96, 19th ACM international conference on research and development in information retrieval (pp. 76-84). New York: ACM Press.
11. Hoenkamp, E., Stegeman, O., & Schomaker, L. (1999). Supporting content retrieval from WWW via 'basic level categories'. In Proceedings of SIGIR-99, 22nd ACM international conference on research and development in information retrieval. (pp. 311-312). New York: ACM Press.
12. Khokhar, A., Thulasiraman, P., Heber, G., & Gao, G. (1999). Load adaptive algorithms and implementations for the 2D discrete wavelet transform on fine-grain multithreaded architectures. In Proceedings of IPPS/SPDP-99, the International Parallel and Distributed Processing Symposium (pp. 458-462). New York: ACM Press.
13. Landauer, T.K., & Dumais, S.T. (1997). A solution to plato's problem: The latent semantic analysis theory of acquisition, induction and representation of knowledge. Psychological Review, 104 (2), 211-240.
14. Ogden, R. T. (1992). Essential wavelets for statistical applications and data analysis. Boston: Birkhäuser.
15. Salton, G. (1968). Automatic information organization and retrieval. New York: McGraw-Hill.
16. Stewart, G.W. (1992). On the early history of the singular value decomposition. Siam Review, 35 (4), 551-566.
17. van Rijsbergen, C.J. (1979). Information retrieval. London: Butterworths.