| Summary: | 碩士 === 國立臺灣科技大學 === 電子工程系 === 88 === With the increasing availability of information on the WWW (World Wide Web), it becomes more important and feasible to retrieve information efficiently and effectively. Current search engines are created for the purpose of sifting through non-relevant information and retrieving only those pieces of user interests. However, many difficulties, such as word misusage of human beings, short queries in retrieval systems and ambiguities in Chinese word identification, would cause these search tools to reach their limitations. Therefore, we propose an interactive searching scheme that aims to provide users an easy way to articulate their queries and to retrieve information best fit to their interests. In this research, a co-occurrence based association thesaurus is involved while users submit their initial queries. This thesaurus is well arranged by means of an organization technique, so that terms in the association thesaurus offered as suggestions could be effortless for users to decide which to add. Then, the reformulated queries accompanied with some query modification methods are submitted to perform another round of searching. Two test collections were used to construct the association thesaurus in order to see how dataset criteria affect the constructed thesaurus. Experimental results show that a homogeneous collection would get in a robust thesaurus that is useful for interactive query expansion. On the other hand, two weighting schemes for query modification were also examined and the results show that there are some compromises of using them. In summary, we concluded that interactive query expansion based on association thesaurus achieves better performance in both precision and recall rate significantly.
|
|---|
