<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Boolean similarity measures for Internet resource discovery services</title>
  </titleInfo>
  <name type="personal">
    <namePart>Addanki, Padma</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Sadananda, Ramakoti</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Batanov, Dentcho N.</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Acharya, Sushil</namePart>
    <role>
      <roleTerm type="text">Examination committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>The Royal Netherlands Government</namePart>
    <role>
      <roleTerm type="text">Scholarship donor</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">th</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Bangkok</placeTerm>
    </place>
    <publisher>Asian Institute of Technology</publisher>
    <dateIssued>1998</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <extent>65 p.</extent>
  </physicalDescription>
  <abstract>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. </abstract>
  <note>A thesis submitted in partial fulfillment of the requirements for the degree of Master of  Science, School of Advanced Technologies</note>
  <note>Thesis (M.Sc.) - Asian Institute of Technology, 1998</note>
  <subject authority="lcsh">
    <topic>Internet (Computer network)</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Thesis ; no. CS-98-5</title>
    </titleInfo>
    <name type="corporate">
      <namePart>Asian Institute of Technology.</namePart>
      <namePart/>
    </name>
  </relatedItem>
  <identifier type="uri">http://203.159.5.9/ait-thesis/detail.php?q=B13248</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B13248</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">021298</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260817171643.0</recordChangeDate>
  </recordInfo>
</mods>
