Scribd
Upload
59 views

Unit IV Recommender System

The document discusses hierarchical clustering and its steps. It then discusses recommender systems and the algorithms used for building them including association rules, collaborative filtering and matrix factorization. It provides examples of datasets and demonstrates how to generate association rules from transactional data using the apriori algorithm.

Uploaded by

Suja Mary
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
59 views

Unit IV Recommender System

The document discusses hierarchical clustering and its steps. It then discusses recommender systems and the algorithms used for building them including association rules, collaborative filtering and matrix factorization. It provides examples of datasets and demonstrates how to generate association rules from transactional data using the apriori algorithm.

Uploaded by

Suja Mary
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Unit-IV

HIERARCHICAL CLUSTERING

Hierarchical clustering is a clustering algorithm which uses the following steps to develop clusters:

1. Start with each data point in a single cluster.

2. Find the data points with the shortest distance (using an appropriate distance measure) and merge
them to form a cluster.

3. Repeat step 2 until all data points are merged together to form a single cluster.

 The above procedure is called an agglomerative hierarchical cluster.


 AgglomerativeClustering in sklearn. cluster provides an algorithm for hierarchical clustering and
also takes the number of clusters to be created as an argument.
 The agglomerative hierarchical clustering can be represented and understood by using
dendrogram
from sklearn.cluster import AgglomerativeClustering
h_clusters = AgglomerativeClustering(3)
h_clusters.fit(scaled_beer_df)
beer_df[“h_clusterid”] = h_clusters.labels_
Compare the Clusters Created by K-Means and Hierarchical Clustering
To print each cluster independently and interpret the characteristic of each cluster.
beer_df[beer_df.h_clusterid == 0]

Recommender Systems
Recommendation systems are a set of algorithms which recommend most relevant items to
users based on their preferences predicted using the algorithms.
The following three algorithms that are widely used for building recommendation systems:
1. Association Rules
2. Collaborative Filtering
3. Matrix Factorization
Datasets
Using the following two publicly available datasets and build recommendations.
1. groceries.csv: This dataset contains transactions of a grocery store and can be downloaded from
http://www.sci.csueastbay.edu/~esuess/classes/Statistics_6620/Presentations/ml13/groceries.csv.
2. Movie Lens: This dataset contains 20000263 ratings and 465564 tag applications across 27278 movies.
The dataset can be downloaded from the link https://grouplens.org/datasets/movielens

ASSOCIATION RULES (ASSOCIATION RULE MINING)


 Association rule find combination lf items that frequently occur together in orders or baskets.
 The items that frequently occur together are called itemsets.
 An application of association rule mining is in Market Basket Analysis(MBA).
 MBA is a technique used mostly by retailers to find associations between items purchased by
customers,
To illustrate the association rule mining concept, let us consider a set of baskets and the items in those
baskets purchased by customers as depicted in Figure 9.1.

Items purchased in different baskets are:


1. Basket 1: egg, beer, sugar, bread, diaper
2. Basket 2: egg, beer, cereal, bread, diaper
3. Basket 3: milk, beer, bread
4. Basket 4: cereal, diaper, bread
The primary objective of a recommender system is to predict items that a customer may purchase in the
future based on his/her purchases so far. In future, if a customer buys beer, can we predict what he/she
is most likely to buy along with beer? To predict this, we need to find out which items have shown a
strong baskets purchased previously association with beer in previously purchased basket.

Association rule considers all possible combination of items in the previous baskets and computes
various measures such as support, confidence, and li- to identify rules with stronger associations.
One solution to retail problem is to eliminate items that possibly cannot be part of any itemsets. One
such algorithm the association rules use apriori algorithm. The apriori algorithm was proposed by
Agrawal and Srikant (1994). The rules generated are represented as

{diapers} -> {beer}

which means that customers who purchased diapers also purchased beer in the same basket.
{diaper, beer} together is called itemset. {diaper} is called the antecedent and the {beer} is consequent.

Metrics

Concepts such as support, confidence, and lift are used to generate association rules

Support indicates the frequencies of items are appearing together in baskets with respect to all
possible baskets being considered.

Lift value 1 indicate the item being independent. Lift value less than 1 implies the product are
substitution, and greater than 1 implies purchasing product increases and necessary for creating
association rule.

Applying Association Rules


To create association rules using the transactions data available in the groceries.csv dataset. Each line in the
dataset is an order and contains a variable number of items.
Loading the Dataset
Python’s open() method can be used to open the file and readlines() to read each line. The following code
block can be used for loading and reading the data:

The steps in this code block are explained as follows:


1. The code opens the file groceries.csv.
2. Reads all the lines from the file.
3. Removes leading or trailing white spaces from each line.
4. Splits each line by a comma to extract items.
5. Stores the items in each line in a list.
Encoding the Transactions
 Python library mlxtend provides methods to generate association rules from a list of transactions. The
transactions and items need to be converted into a tabular or matrix format.
 The matrix size will be of M × N, where M represents the total number of transactions and N
represents all unique items available across all transactions.
 The mlxtend library has a feature pre-processing implementation class called OnehotTransactions that
will take all_txns as an input and convert the transactions and items into one-hot-encoded format.
 The code for converting the transactional data using one-hot encoding is as follows:

The following code can be used for finding the size (shape or dimension) of the matrix.
one_hot_txns_df.shape
(9835, 171)
Generating Association Rules
To use apriori algorithms to generate itemset. The total number of itemset will depend on the
number of items that exist across all transactions
len(one_hot_txns_df.columns)
171
The code gives us an output of 171, that is, as mentioned in the previous section, there are 171 items. For
itemset containing 2 items in each set, the total number of itemsets will be 171C2, that is, the number of itemset
will be 14535.
Apriori algorithm takes the following parameters:
1. df: pandas − DataFrame in a one-hot-encoded format.
2. min_support: float − A float between 0 and 1 for minimum support of the itemsets returned.
Default is 0.5.
3. use_colnames: boolean − If true, uses the DataFrames’ column names in the returned DataFrame instead of
column indices.
The following commands can be used for setting minimum support.

Top Ten Rules


The top 10 association rules sorted by confidence. The rules stored in the variable rules are
sorted by con_dence in descending order
rules.sort_values( ‘confidence’,ascending = False)[0:10]
Pros and Cons of Association Rule Mining
The following are advantages of using association rules:
1. Transactions data, which is used for generating rules, is always available and mostly clean.
2. The rules generated are simple and can be interpreted.

You might also like