DocumentCode :
442976
Title :
Adaptive calculation of scores for fresh information retrieval
Author :
Uehara, Minoru ; Sato, Nobuyoshi ; Sakai, Yoshifumi
Author_Institution :
Dept. of Inf. & Comput. Sci., Toyo Univ., Kawagoe, Japan
Volume :
1
fYear :
2005
fDate :
20-22 July 2005
Firstpage :
750
Abstract :
In business, we need fresh information. In order to realize fresh information retrieval, we need not only to collect documents in a short time, but also to rank the results in the suitable order. However, conventional ranking methods are not suited for fresh information retrieval because they ignore temporal value of information. So, we have proposed the novel ranking method FTF-IDF for fresh information retrieval. FTF-IDF extends TF-IDF by means of using FTF (fresh term frequency) instead of TF (term frequency). FTF differs from TF because FTF decreases as time goes. The speed of decreasing FTF is determined by the dumping factor. The dumping factor is sensitive against small changes of documents. So, we use a threshold to ignore such small changes. In some papers, we published, we detect the optimal threshold manually. In this paper, we proposed an adaptive calculating method in order to detect threshold automatically. In this method, the optimal value is determined by iterating to test generated thresholds. In this paper, we describe our method and its evaluation.
Keywords :
information retrieval; FTF-IDF; adaptive score calculation; distributed search engine; dumping factor; fresh term frequency; information retrieval; optimal threshold; ranking method; Chaos; Content based retrieval; Entropy; Frequency; Information retrieval; Information theory; Plants (biology); Search engines; Testing; Web pages; distributed search engine; fresh information retrieval; ranking;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Systems, 2005. Proceedings. 11th International Conference on
ISSN :
1521-9097
Print_ISBN :
0-7695-2281-5
Type :
conf
DOI :
10.1109/ICPADS.2005.65
Filename :
1531207
Link To Document :
بازگشت