請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/38316
標題: | 支援布林查詢的以序列為基礎之文件檢索系統 Supporting Boolean Queries in a Sequence-Based Text Retrieval System |
作者: | Chun-Kai Jan 詹淳凱 |
指導教授: | 蔡益坤 |
關鍵字: | 布林運算子,布林查詢,資訊檢索,文件檢索,序列模式,序列相似度, Boolean Operators,Boolean Queries,Information Retrieval,Text Retrieval,Sequence Model,Sequence Similarity, |
出版年 : | 2005 |
學位: | 碩士 |
摘要: | In most text retrieval models, relevance is judged using keywords. In contrast, the sequence model judges relevance by the similarity between character sequences. The sequences suggest the importance of positional information, which can avoid the Chinese word segmentation problem when applied to Chinese text retrieval. The sequence model can satisfy users’ information needs for long natural queries about some specific terms, because the query is represented as a sequence.
This model can be enhanced by allowing Boolean queries, which can describe a user’s information needs more precisely, especially when the user is highly trained. In this study, a method based on Fuzzy Set Theory, which supports Boolean queries in the sequence model, is proposed. In addition, two algorithms are introduced by transforming the Boolean queries into the Disjunctive Normal Form (DNF) or the Conjunctive Normal Form (CNF). For the sake of efficiency, these algorithms are designed to obtain approximate results. In this work, the three algorithms are incorporated into a new implementation in C/C++. This version of the system also improves the efficiency of the query process, since efficiency is always an issue of the SIR system, an implementation of the sequence model. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/38316 |
全文授權: | 有償授權 |
顯示於系所單位: | 資訊管理學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-94-1.pdf 目前未授權公開取用 | 553.07 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。