Ekspansi Kueri pada Sistem Temu Kembali Informasi dengan Tesaurus dan Pendekatan Boolean

Abstract

This research implements and evaluates the implementation of automatic query expansion with synonyms and antonyms derived from thesaurus with boolean approach. The research was conducted because query expansion in the previous research by Pancawan using intersection weight required a long time. This research used 2095 documents and 30 queries. Using one synonym produced the best performance with an average F1 of 0.06376 in average time of query expansion 5.256 seconds, while the previous research produced an average F1 of 0.06385 in 23.451 seconds. Using one antonym on this and previous research produced the same average F1 of 0.06651. However, the average time required for the query expansion in this research was 1.916 seconds, only half of the previous research that took 4.890 seconds. From the evaluation result of the document retrieval comparison, this research obtained a similar performance in less time.