Boolean similarity measures for Internet resource discovery services
Call Number: AIT Thesis no.CS-98-5 Material type:
TextSeries: Asian Institute of Technology. Thesis ; no. CS-98-5Publication details: Bangkok : Asian Institute of Technology, 1998Description: 65 pSubject(s): Online resources: Dissertation note: Thesis (M.Sc.) - Asian Institute of Technology, 1998 Summary: The promise of the information age entails controlling the potentially unwanted flux of information from sources to their receiving end-users and deliver just the relevant information. The servers on the Web represent a vast potential resource. As the number of these Internet servers increases rapidly, it becomes difficult to determine the relevant servers when searching for information. To address this issue, it is necessary to formalize the querries and the servers and develop a measure of similarity between them. We have reviewed the literature available in this area, paying attention to similarity measure. We propose a new similarity measure to rank information filtering system for Boolean queries. The focus is on Boolean environments as it is generally believed that Boolean expressions can precisely describe a server's contents as well as a user's information need. Users can send queries to the top-ranked systems and obtain most of the relevant information. To compare the performance of the existing measure, we conducted two case studies on compendex databases. The thesis includes the details of the case study experiments and performance comparisons of the proposed measure with those available. The results are found to be encouraging.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
22-AIT Thesis (Replacement)
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no.CS-98-5 (Browse shelf(Opens below)) | 3 | Available | 30050120682462 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT Thesis no.CS-98-5 (Browse shelf(Opens below)) | Available | 30050120355374 |
A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science, School of Advanced Technologies
Thesis (M.Sc.) - Asian Institute of Technology, 1998
The promise of the information age entails controlling the potentially unwanted flux of information from sources to their receiving end-users and deliver just the relevant information. The servers on the Web represent a vast potential resource. As the number of these Internet servers increases rapidly, it becomes difficult to determine the relevant servers when searching for information. To address this issue, it is necessary to formalize the querries and the servers and develop a measure of similarity between them. We have reviewed the literature available in this area, paying attention to similarity measure. We propose a new similarity measure to rank information filtering system for Boolean queries. The focus is on Boolean environments as it is generally believed that Boolean expressions can precisely describe a server's contents as well as a user's information need. Users can send queries to the top-ranked systems and obtain most of the relevant information. To compare the performance of the existing measure, we conducted two case studies on compendex databases. The thesis includes the details of the case study experiments and performance comparisons of the proposed measure with those available. The results are found to be encouraging.
There are no comments on this title.

AI Search