Predicting Missing Items in Shopping Carts using Fast Algorithm

Prediction in shopping cart uses partial information about the contents of a shopping cart for the prediction of what else the customer is likely to buy. In order to reduce the rule mining cost, a fast algorithm generating frequent itemsets without generating candidate itemsets is proposed. The algo...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer applications 2011-01, Vol.21 (5), p.35-41
Main Authors: M, Srivatsan, Kumar. M, Sunil, V, Vijayshankar, Rani P, Leela
Format: Article
Language:English
Subjects:
Algorithms
Boolean algebra
Carts
Cost engineering
Mathematical analysis
Shopping
Vectors (mathematics)
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Prediction in shopping cart uses partial information about the contents of a shopping cart for the prediction of what else the customer is likely to buy. In order to reduce the rule mining cost, a fast algorithm generating frequent itemsets without generating candidate itemsets is proposed. The algorithm uses Boolean vector with relational AND operation to discover frequent itemsets and generate the association rule. Association rules are used to identify relationships among a set of items in database. Initially Boolean Matrix is generated by transforming the database into Boolean values. The frequent itemsets are generated from the Boolean matrix. Then association rules are to generated from the already generated frequent itemsets. The association rules generated form the basis for prediction. The incoming itemset i.e the content of incoming shopping cart will also be represented by a Boolean vector and AND operation is performed with each transaction vector to generate the association rules. Finally the rules are combined to get the predictions. Dempster's rule of combination (DRC) is used to combine the evidences. Finally the predicted items are suggested to the user.
ISSN:0975-8887
0975-8887
DOI:10.5120/2504-3385