한국지능시스템학회:학술대회논문집 (Proceedings of the Korean Institute of Intelligent Systems Conference)
- 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
- /
- Pages.240-245
- /
- 1998
Acceleration of Building Thesaurus in Fuzzy Information Retrieval Using Relational products
- Kim, Chang-Min (Dept. of Computer Science, Information and Communication Research Center) ;
- Kim, Young-Gi (Dept. of Computer Science, Information and Communication Research Center)
- 발행 : 1998.06.01
초록
Fuzzy information retrieval which uses the concept of fuzzy relation is able to retrieve documents in the way based on not morphology but semantics, dissimilar to traditional information retrieval theories. Fuzzy information retrieval logically consists of three sets : the set of documents, the set of terms and the set of queries. It maintains a fuzzy relational matrix which describes the relationship between documents and terms and creates a thesaurus with fuzzy relational product. It also provides the user with documents which are relevant to his query. However, there are some problems on building a thesaurus with fuzzy relational product such that it has big time complexity and it uses fuzzy values to be processed with flating-point. Actually, fuzzy values have to be expressed and processed with floating-point. However, floating-point operations have complex logics and make the system be slow. If it is possible to exchange fuzzy values with binary values, we could expect sp eding up building the thesaurus. In addition, binary value expressions require just a bit of memory space, but floating -point expression needs couple of bytes. In this study, we suggest a new method of building a thesaurus, which accelerates the operation of the system by pre-applying an