TY - GEN
T1 - Adaptive calculation of scores for fresh information retrieval
AU - Uehara, Minoru
AU - Sato, Nobuyoshi
AU - Sakai, Yoshifumi
PY - 2005/9/1
Y1 - 2005/9/1
N2 - 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 FTFIDF for fresh information retrieval. FTF·IDF extends TF·IDF by means of using FTF(fresh term frequency) instead of TF(term frequency). FTP differs from TF because FTP decreases as time goes. The speed of decreasing FTP 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.
AB - 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 FTFIDF for fresh information retrieval. FTF·IDF extends TF·IDF by means of using FTF(fresh term frequency) instead of TF(term frequency). FTP differs from TF because FTP decreases as time goes. The speed of decreasing FTP 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.
KW - Distributed search engine
KW - Fresh information retrieval
KW - Ranking
UR - http://www.scopus.com/inward/record.url?scp=23944484969&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=23944484969&partnerID=8YFLogxK
U2 - 10.1109/ICPADS.2005.65
DO - 10.1109/ICPADS.2005.65
M3 - Conference contribution
AN - SCOPUS:23944484969
SN - 0769522815
T3 - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
SP - 750
EP - 755
BT - Proceedings - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005
A2 - Barolli, L.
T2 - 11th International Conference on Parallel and Distributed Systems Workshops, ICPADS 2005
Y2 - 20 July 2005 through 22 July 2005
ER -