ACM Home Page
Please provide us with feedback. Feedback
Online selection of parameters in the rocchio algorithm for identifying interesting news articles
Full text PdfPdf (791 KB)
Source
Workshop On Web Information And Data Management archive
Proceeding of the 10th ACM workshop on Web information and data management table of contents
Napa Valley, California, USA
SESSION: Ranking and similarity search table of contents
Pages 141-148  
Year of Publication: 2008
ISBN:978-1-60558-260-3
Authors
Raymond K. Pon  UC Los Angeles, Los Angeles, CA, USA
Alfonso F. Cárdenas  UC Los Angles, Los Angeles, CA, USA
David J. Buttler  Lawrence Livermore National Laboratory, Livermore, CA, USA
Sponsors
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1458502.1458525
What is a DOI?

ABSTRACT

We show that users have different reading behavior when evaluating the interestingness of articles, calling for different parameter configurations for information retrieval algorithms for different users. Better recommendation results can be made if parameters for common information retrieval algorithms, such as the Rocchio algorithm, are learned dynamically instead of being statically fixed a priori. By dynamically learning good parameter configurations, Rocchio can adapt to differences in user behavior among users. We show that by adaptively learning online the parameters of a simple retrieval algorithm, similar recommendation performance can be achieved as more complex algorithms or algorithms that require extensive fine-tuning. Also we have also shon that online parameter learning can yield 10% better results than best performing filter from the TREC11 adaptive filter task.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
R. K. Pon, A. F. Cardenas, D. Buttler, and T. Critchlow, "iScore: Measuring the interestingness of articles in a limited user environment," in IEEE Symposium on Computational Intelligence and Data Mining 2007, (Honolulu, HI), April 2007.
 
3
J. Rocchio, Relevance Feedback in Information Retrieval, ch. 14, pp. 313--323. Prentice-Hall, 1971.
 
4
H. Xu, Z. Yang, B. Wang, B. Liu, J. Cheng, Y. Liu, Z. Yang, X. Cheng, and S. Bai, "TREC-11 experiments at CAS-ICT: Filtering and web," in TREC11, 2002
5
6
7
 
8
 
9
T. Joachims, "A probabilistic analysis of the Rocchio algorithm with TF-IDF for text categorization," Tech. Rep. CMU-CS-96-118, Carnegie Mellon University, 1996.
 
10
S. Robertson and I. Soboroff, "The TREC 2002 filtering track report," in TREC 2002, 2002.
 
11
Apache, "Apache UIMA." {Online} http://incubator.apache.org/uima/, 2008.
 
12
R.K. Pon, "iScore." {Online} http://sourceforge.net/projects/iscore/, 2008.
 
13
Yahoo, "Yahoo news RSS feeds." {Online} http://news.yahoo.com/rss, 2008.
 
14
Alias-I, "LingPipe," {Online}. http://www.alias-i.com/lingpipe/index.html, 2008.

Collaborative Colleagues:
Raymond K. Pon: colleagues
Alfonso F. Cárdenas: colleagues
David J. Buttler: colleagues