<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>01789nam a22001217a 4500</leader>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">65935</subfield>
    <subfield code="d">65932</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Shabab Akram </subfield>
    <subfield code="a">15MSSE13</subfield>
    <subfield code="a">Supervisor - Dr. Imtiaz Ali Halepoto</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Recommender System Using Collaborative Filtering </subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Nawabshah:</subfield>
    <subfield code="b">QUEST,</subfield>
    <subfield code="c">2019.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">ABSTRACT

A recommender system is a subclass of information filtering system that is used to predict the value or priority of an item, for example in shopping online. One of the famous classes to recommend an item or value is the collaborative filtering, which presents the product according to the interest/preferences of the active user. Unfortunately, this technique suffers from many problems like sparsity and scalability for huge databases, which contains huge number of users and items. To design an
efficient recommender systems the techniques of union and intersection are most widely used.

This work presents an analysis about collaborative filtering techniques. The techniques used are union, -intersection and neighborhood. For the implementation a local database of movies is created. After the implementation these three techniques, the neighborhood technique provides greater accuracy when compared with union and intersection. The collaborative filtering through neighborhood method also recommends all of the unwatched movies. However in terms of diversity of choice the union based technique provided a better user experience through recommendation of movies from different categories. In terms of popularity, the neighborhood collaborative filtering also includes the more number of less popular movies in the recommendations when compared with the union and intersection techniques.
</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Department of Information Technology</subfield>
  </datafield>
  <datafield tag="856" ind1=" " ind2=" ">
    <subfield code="u">https://tinyurl.com/y7cw25bk</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">THESIS</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">RESEARCH</subfield>
    <subfield code="b">RESEARCH</subfield>
    <subfield code="d">2019-10-21</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">R/IMS-19</subfield>
    <subfield code="p">MP/54-678</subfield>
    <subfield code="r">2019-10-21 00:00:00</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">RESEARCH</subfield>
    <subfield code="b">RESEARCH</subfield>
    <subfield code="d">2023-12-18</subfield>
    <subfield code="l">0</subfield>
    <subfield code="p">MP/47-549</subfield>
    <subfield code="r">2023-12-18 00:00:00</subfield>
    <subfield code="w">2023-12-18</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
</record>
