loading...
The Evaluations of FTF-IDF Scoring for Fresh Information Retrieval
Taipei, Taiwan March 25-March 30
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINA.2005.32619th International Conference on Adva ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Nobuyoshi Sato, Toyo University
Minoru Uehara, Toyo University
Yoshifumi Sakai, Tohoku University
Fresh information is important for real business. However, conventional search engines are not suited for fresh information retrieval because they are based on centralized architecture. So, we have developed a distributed search engine, Cooperative Search Engine (CSE), which based on distributed architecture. CSE can search fresh information in a short time. The cost of fresh information retrieval is O(1) in the average case, but O(n) in the worst case. So, CSE is scalable, because it is not depended on the system scale. However, even if the performance is good, it is not enough for fresh information retrieval. The value of information is determined by both freshness and relevance. Traditional ranking methods consider either freshness or relevance. So, we propose FTF-IDF scoring which considers both freshness and relevance. In this paper, we evaluate its effects.
Index Terms:
web information retrieval, distributed search engine
Citation:
Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai, "The Evaluations of FTF-IDF Scoring for Fresh Information Retrieval," aina, vol. 1, pp.635-640, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers), 2005
Usage of this product signifies your acceptance of the Terms of Use.