Scribd
Upload
87 views5 pages

Split Data

This document shows code for analyzing grocery transaction data using association rule mining. It preprocesses the transaction data, calculates item frequencies, and generates frequent itemsets and association rules. It visualizes the top 10 frequent items and itemsets. Additionally, it removes redundant rules and displays the top 10 rules by lift. The code also shows how to generate and visualize association rules for movie recommendation data.

Uploaded by

nehal gundrapally
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
87 views5 pages

Split Data

This document shows code for analyzing grocery transaction data using association rule mining. It preprocesses the transaction data, calculates item frequencies, and generates frequent itemsets and association rules. It visualizes the top 10 frequent items and itemsets. Additionally, it removes redundant rules and displays the top 10 rules by lift. The code also shows how to generate and visualize association rules for movie recommendation data.

Uploaded by

nehal gundrapally
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

# splitting the data into separate transactions using separator as "\n"

groceries = groceries.split("\n")

groceries_list = []
for i in groceries:
groceries_list.append(i.split(","))

all_groceries_list = [i for item in groceries_list for i in item]

from collections import Counter # ,OrderedDict

item_frequencies = Counter(all_groceries_list)

# after sorting
item_frequencies = sorted(item_frequencies.items(), key = lambda x:x[1])

# Storing frequencies and items in separate variables


frequencies = list(reversed([i[1] for i in item_frequencies]))
items = list(reversed([i[0] for i in item_frequencies]))

# barplot of top 10
import matplotlib.pyplot as plt

plt.bar(height = frequencies[0:11], x = list(range(0, 11)), color = 'rgbkymc')


plt.xticks(list(range(0, 11), ), items[0:11])
plt.xlabel("items")
plt.ylabel("Count")
plt.show()

# Creating Data Frame for the transactions data


groceries_series = pd.DataFrame(pd.Series(groceries_list))
groceries_series = groceries_series.iloc[:9835, :] # removing the last empty transaction

groceries_series.columns = ["transactions"]

# creating a dummy columns for the each item in each transactions ... Using column names as
item name
X = groceries_series['transactions'].str.join(sep = '*').str.get_dummies(sep = '*')

frequent_itemsets = apriori(X, min_support = 0.0075, max_len = 4, use_colnames = True)

# Most Frequent item sets based on support


frequent_itemsets.sort_values('support', ascending = False, inplace = True)

plt.bar(x = list(range(0, 11)), height = frequent_itemsets.support[0:11], color ='rgmyk')


plt.xticks(list(range(0, 11)), frequent_itemsets.itemsets[0:11])
plt.xlabel('item-sets')
plt.ylabel('support')
plt.show()

rules = association_rules(frequent_itemsets, metric = "lift", min_threshold = 1)


rules.head(20)
rules.sort_values('lift', ascending = False).head(10)

################################# Extra part ###################################


def to_list(i):
return (sorted(list(i)))

ma_X = rules.antecedents.apply(to_list) + rules.consequents.apply(to_list)

ma_X = ma_X.apply(sorted)

rules_sets = list(ma_X)

unique_rules_sets = [list(m) for m in set(tuple(i) for i in rules_sets)]

index_rules = []

for i in unique_rules_sets:
index_rules.append(rules_sets.index(i))

# getting rules without any redudancy


rules_no_redudancy = rules.iloc[index_rules, :]

# Sorting them with respect to list and getting top 10 rules


rules_no_redudancy.sort_values('lift', ascending = False).head(10)

print(text.split())
install.packages("arules")

library("arules") # Used for building association rules i.e. apriori algorithm


movie<-read.csv(file.choose())

inspect(movie[1:10])
class(movie)

summary(movie)
# making rules using apriori algorithm

# Building rules using apriori algorithm

arules<-apriori(movie,parameter = list(support = 0.004, confidence = 0.70, minlen = 1))


arules

inspect(head(sort(arules, by = "lift"))) # to view the inspect

head(quality(arules))

library("arulesViz") # for visualizing rules


plot(arules)

windows()
plot(arules, method = "grouped")
plot(arules[1:10], method = "graph") # for good visualization try plotting only few rules
write(arules, file = "a_rules.csv", sep = ",")

getwd()

You might also like