0% found this document useful (0 votes)
42 views

Collaborative Filtering: Niranjan Shah (073/BCT/545) Shekhar Khadka (073/BCT/572)

Collaborative filtering is a process that uses opinions from many users to filter and evaluate items. It works by matching users with similar interests based on their ratings of items like books, movies, etc. and then recommending unrated items that similar users liked. Ratings can be numeric, categorical, binary or just indicate an item was observed. The absence of a rating means no information is known about that user-item pair. Collaborative filtering systems work by collecting user ratings, finding similar users, and recommending highly rated items from similar users that the active user has not rated.

Uploaded by

gfcrf
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
42 views

Collaborative Filtering: Niranjan Shah (073/BCT/545) Shekhar Khadka (073/BCT/572)

Collaborative filtering is a process that uses opinions from many users to filter and evaluate items. It works by matching users with similar interests based on their ratings of items like books, movies, etc. and then recommending unrated items that similar users liked. Ratings can be numeric, categorical, binary or just indicate an item was observed. The absence of a rating means no information is known about that user-item pair. Collaborative filtering systems work by collecting user ratings, finding similar users, and recommending highly rated items from similar users that the active user has not rated.

Uploaded by

gfcrf
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Collaborative Filtering

Niranjan Shah(073/BCT/545)
Shekhar Khadka(073/BCT/572)
Collaborative Filtering


Collaborative filtering(CF) is the process of filtering or
evaluating items through the opinions of other people.

CF technology brings together the opinions of large
interconnected communities on the web, supporting filtering
of substantial quantities of data.

Collaborative filtering systems produce predictions or
recommendations for a given user and one or more items.
Items can consist of anything for which a human can provide
a rating, such as art, books, CDs, journal articles, or vacation
destinations.

Collaborative Filtering


Ratings in a collaborative filtering system can take on a
variety of forms.

• Scalar ratings can consist of either numerical ratings, such as the
1-5 stars provided in ordinal ratings such as strongly agree, agree,
neutral, disagree, strongly disagree.

• Binary ratings model choices between agree/disagree or
good/bad.

• Unary ratings can indicate that a user has observed or purchased
an item, or otherwise rated the item positively.

The absence of a rating indicates that we have no information
relating the user to the item (perhaps they purchased the item
somewhere else).
Collaborative Filtering


Match people with similar interests as a basis for
recommendation.

Many people must participate to make it likely that a person
with similar interests will be found.

There must be a simple way for people to express their
interests.

There must be an efficient algorithm to match people with
similar interests.
Collaborative Filtering


Users rate items – user interests recorded.

Ratings may be:

Explicit, e.g. buying or rating an item

Implicit, e.g. browsing time, no. of mouse clicks

Nearest neighbour matching used to find people with similar
interests

Items that neighbours rate highly but that you have not rated
are recommended to you

User can then rate recommended items
Example

Items / Data Search Data XML


Users Mining Engines Bases
Alex 1 NR 5 4
George 2 3 4 NR
Mark 4 5 NR 2
Peter NR NR 4 5


*NR= Not Rated
Observation


Can construct a vector for each user (where 0 implies
an item is unrated)

E.g. for Alex: <1,0,5,4>

E.g. for Peter <0,0,4,5>

On average, user vectors are sparse, since users rate
(or buy) only a few items.

Vector similarity or correlation can be used to find
nearest neighbour.

E.g. Alex closest to Peter, then to George.
THANK YOU
Simulation in GPSS
Simulation in GPSS
Simulation in GPSS
Simulation in GPSS

You might also like