ASHOKA WOMEN’S ENGINEERING COLLEGE (AUTONOMOUS)
UNIT- 5
RECOMMENDER SYSTEM:
A recommendation system, also known as a recommender system is a subclass of Information
filtering Systems that seeks to predict the “rating” or the “preference” a user might give to
an item. In simple words, it is an algorithm that suggests relevant items to users.
The primary goal of a recommendation system is to provide personalized suggestions to users
based on their past behavior, preferences, and similarities with other users.
Recommendation system plays an important role in helping us have a better user experience.
Some example of recommender systems in action includes product recommendations on Amazon,
Netflix suggestions for movies and TV shows in your feed.
Recommended videos on YouTube, music on Spotify, the Facebook newfeed and Google Ads.
V. ARUNA KUMARI-Asst. Professor-Dept of MCA
Page 1
ASHOKA WOMEN’S ENGINEERING COLLEGE (AUTONOMOUS)
V. ARUNA KUMARI-Asst. Professor-Dept of MCA
Page 2
ASHOKA WOMEN’S ENGINEERING COLLEGE (AUTONOMOUS)
V. ARUNA KUMARI-Asst. Professor-Dept of MCA
Page 3
ASHOKA WOMEN’S ENGINEERING COLLEGE (AUTONOMOUS)
SOCIAL NETWORK GRAPHS:
What is a Social Network?
When we think of a social network, we think of Facebook, Twitter, Google+, or another website
that is called a “social network,” and indeed this kind of network is representative of the broader class of
networks called “social.”
Social Network Analysis (SNA), also known as network science, is a general study of the social network
utilizing network and graph theory concepts. It explores the behavior of individuals at the micro-level, their
relationships (social structure) at the macro level, and the connection between the two.
Entities= nodes of the graph
The essential characteristics of a social network are:
There is a collection of entities that participate in the network. Typically, these entities are people,
There is at least one relationship between entities of the network. On Facebook or its ilk, this
relationship is called friends.
Sometimes Boolean: two people may be friends, or not.
There is an assumption of non randomness or locality. This condition is the hardest to formalize,
but the intuition is that relationships tend to cluster. That is, if entity A is related to both B and C,
then there is a higher probability than average that B and C are related.
Social Networks as Graphs:
Social networks are naturally modeled as graphs, which we sometimes refer to as a social graph.
The entities are the nodes, and an edge connects two nodes if the nodes are related by the
relationship that characterizes the network.
If there is a degree associated with the relationship, this degree is represented by labeling the edges.
Often, social graphs are undirected, as for the Facebook friends graph. But they can be directed
graphs, as for example the graphs of followers on Twitter or Google+.
LOCALITY (non-randomness) property:
The relationship tends to cluster,
If A is related to both B, C then the probability that B and C are related is higher than random.
Having mutual friends increase the chance two people knowing each other.
Let B and C be two random entities.
P [B and C are Connected] would be very small.
However, if it is known that there is a mutual connection A, then the probability would be significant
higher.
V. ARUNA KUMARI-Asst. Professor-Dept of MCA
Page 4
ASHOKA WOMEN’S ENGINEERING COLLEGE (AUTONOMOUS)
Example:
Check for the non-randomness criterion.
In a random graph (V,E) of 7 nodes and 9 edges, if XY is an edge, YZ is an edge, what is the
probability that XZ is an edge?
For a large random graph, it would be close to |E|/(|V| C2) = 9/21 ~ 0.43
Small graph: XY and YZ are already edges, so compute within the rest –
So the probability is (|E|−2)/(|V| C2−2) = 7/19 = 0.37
Now let’s compute what is the probability for this graph in particular
But also several other types:
Telephone network:
Nodes are phone numbers.
AB is an edge if A and B talked over phone within the last one week, or month, or ever.
Edges could be weighted by the number of times phone calls were made, or total time of conversation.
Email network:
Nodes are email addresses.
AB is an edge if A and B sent mails to each other within the last one week, or month, or ever – One
directional edges would allow spammers to have edges.
Edges could be weighted.
V. ARUNA KUMARI-Asst. Professor-Dept of MCA
Page 5
ASHOKA WOMEN’S ENGINEERING COLLEGE (AUTONOMOUS)
IMAGE CLASSIFICATION:
Image classification refers to a process in computer vision that can classify an image according to
its visual content.
Image classification refers to the labeling of images into one of a number of predefined classes.
Image classification is the primary domain, in which deep neural networks play the most important
role in image analysis.
Structure for performing Image Classification:
1. Image Pre-processing:
The aim of this process is to improve the image data (features) by suppressing unwanted
distortions and enhancement of some important image features so that the computer vision
models can benefit from this improved data to work on.
Steps for image pre-processing includes Reading image, Resizing image, and Data
Augmentation (Gray scaling of image, Reflection, Gaussian Blurring, Histogram,
Equalization, Rotation, and Translation).
2. Detection of an object:
Detection refers to the localization of an object which means the segmentation of the image
and identifying the position of the object of interest.
3. Feature extraction and training:
This is a crucial step wherein statistical or deep learning methods are used to identify the
most interesting patterns of the image,
features that might be unique to a particular class and that will, later on, help the model to
differentiate between different classes.
This process where the model learns the features from the dataset is called model training.
4. Classification of the object:
This step categorizes detected objects into predefined classes by using a suitable
classification technique that compares the image patterns with the target patterns.
V. ARUNA KUMARI-Asst. Professor-Dept of MCA
Page 6
ASHOKA WOMEN’S ENGINEERING COLLEGE (AUTONOMOUS)
V. ARUNA KUMARI-Asst. Professor-Dept of MCA
Page 7
