Insights from viewing ranked retrieval as rank aggregation

Proceedings - International Workshop on Challenges in Web Information Retrieval and Integration, WIRI'05

Volumn 2005, Issue , 2005, Pages 232-237

  Bast, Holger ^a   Weber, Ingmar ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; INDEXING (OF INFORMATION); PROBABILITY; QUERY LANGUAGES;

EASY-TO-COMPUTE; LATENT SEMANTIC INDEXING (LSI); PROBABILISTIC SIBLING PLSI; RANKED RETRIEVAL;

INFORMATION RETRIEVAL;

EID: 33845364011     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIRI.2005.19     Document Type: Conference Paper

References (21)

1. S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman. Indexing by latent semantic analysis. Journal of the American Society of Information Science, 41(6):391-407, 1990.
2. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B, 39:1-38, 1977.
3. I. S. Dhillon and Y. Guan. Information theoretic clustering of sparse co-occurrence data. In Proceedings ICDM'03, pages 517-520, 2003.
4. G. Dupret. Latent concepts and the number of orthogonal factors in latent semantic analysis. In Proceedings of the 26th Annual ACM conference on Research and Development in Informaion Retrieval (SIGIR'03), pages 221-226, 2003.
5. R. Fagin. Combining fuzzy information from multiple systems. In Proceedings PODS'96, pages 216-226, 1996.
6. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In Proceedings PODS'01, pages 102-113, 2001.
7. G. H. Golub and C. van Loan. Matrix Computations (3rd edition). John Hopkins University Press, 1996.
8. T. Hofmann. Unsupervised learning by probabilistic latent semantic analysis. Machine Learning Journal, 42(1):177-196, 2001.
9. P. Husbands, H. Simon, and C. H. Q. Ding. On the use of the singular value decomposition for text retrieval. Computational Information Retrieval, pages 145-156, 2001.
10. Glasgow IDOMENEUS - test collections. http://www.dcs.gla.ac.uk/idom/ir. resources/test_collections/.
11. S. D. Kamvar, D. Klein, and C. D. Manning. Spectral learning. In 18th International Joint Conference on Artificial Intelligence (IJCAI'03), pages 561-566, 2003.
12. T. Kolda and D. O'Leary. A semidiscrete matrix decomposition for latent semantic indexing in information retrieval. ACM Transactions on Information Systems, 16(4):322-346, 1998.
13. D. D. Lee and H. S. Seung. Non-negative matrix factorization discussion and matlab code. http://journalclub.mit.edu/jclub/publication?com_id=2.
14. D. D. Lee and H. S. Seung. Learning the parts of objects by non-negative matrix factorization. Nature, 401:788-791, 1999.
15. D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. In Proceedings NIPS'00, pages 556-562, 2000.
16. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
17. C. H. Papadimitriou, H. Tamaki, P. Raghavan, and S. Vempala. Latent semantic indexing: a probabilistic analysis. In Proceedings PODS'98, pages 159-168. ACM Press, 1998.
18. G. Salton, A. Wong, and C. S. Yang. A vector space model for automatic indexing. Communications of the ACM, 18(11):613-620, 1975.
19. K. Shin and S. Han. Fast clustering algorithm for information organization. In Proceedings CICLing'03, pages 619-622, 2003.
20. C. Silverstein, H. Marais, M. Henzinger, and M. Moricz. Analysis of a very large web search engine query log. Sigir Forum, 33(1):6-12, 1999.
21. A. Vinokourov. Why nonnegative matrix factorization works well for text information retrieval. http://citeseer.ist.psu.edu/458322.html.