On the complexity of Rocchio's similarity-based relevance feedback algorithm-Reference-Cited by-同舟云学术

On the complexity of Rocchio's similarity-based relevance feedback algorithm

Published:2007 Issue:10 Volume:58 Page:1392-1400
ISSN:1532-2882
Container-title:Journal of the American Society for Information Science and Technology
language:en
Short-container-title:J. Am. Soc. Inf. Sci.

Author:

Chen Zhixiang,Fu Bin

Publisher

Wiley

Subject

Artificial Intelligence,Computer Networks and Communications,Human-Computer Interaction,Information Systems,Software

Reference23 articles.

1. & (Eds.). (1999). Modern information retrieval. Essex, UK: Addison-Wesley.

2. , , & (1995). On the learnability of Zn-DNF formulas. In & (Eds.), Proceedings of the 18th Annual Conference on Computational Learning Theory, Lecture Notes in Computer Science 3559 (pp. 198–205). Berlin: Springer.

3. (2001). Multiplicative adaptive algorithms for user preference retrieval. In (Ed.), Proceedings of the Seventh Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science 2108 (pp. 540–549). Berlin: Springer.

4. (2004). Multiplicative adaptive user preference retrieval and its applications to web search. In , , & (Eds.), Computational web intelligence: Intelligent technology for web applications (pp. 303–328). Singapore: World Scientific.

5. & (2005). A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm. In (Ed.), Proceedings of the Eleventh Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science 3595 (pp. 955–964). Berlin: Springer.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A quadratic lower bound for Rocchio’s similarity-based relevance feedback algorithm with a fixed query updating factor;Journal of Combinatorial Optimization;2008-06-03

2. Erratum;Journal of the American Society for Information Science and Technology;2007