Association Rules for Recommendations with Multiple Items

Abhijeet Ghoshal, Sumit Sarkar (2014) Association Rules for Recommendations with Multiple Items. INFORMS Journal on Computing 26(3):433-448

46 Pages Posted: 9 Jan 2021

See all articles by Abhijeet Ghoshal

Abhijeet Ghoshal

University of Illinois at Urbana-Champaign - Department of Business Administration

Sumit Sarkar

University of Texas at Dallas - Department of Information Systems & Operations Management

Date Written: March 06, 2014

Abstract

In Web-based environments, a site has the ability to recommend multiple items to a customer in each interaction. Traditionally, rules used to make recommendations either have single items in their consequents or have conjunctions of items in their consequents. Such rules may be of limited use when the site wishes to maximize the likelihood of the customer being interested in at least one of the items recommended in each interaction (with a session comprising multiple interactions). Rules with disjunctions of items in their consequents and conjunctions of items in their antecedents are more appropriate for such environments. We refer to such rules as disjunctive consequent rules. We have developed a novel mining algorithm to obtain such rules. We identify several properties of disjunctive consequent rules that can be used to prune the search space when mining such rules. We demonstrate that the pruning techniques drastically reduce the proportion of disjunctive rules explored, with the pruning effectiveness increasing rapidly with an increase in the number of items to be recommended. We conduct experiments to compare the use of disjunctive rules with that of traditional (conjunctive) association rules on several real-world data sets and show that the accuracies of recommendations made using disjunctive consequent rules are significantly higher than those made using traditional association rules. We also compare the disjunctive consequent rules approach with two other state-of-the-art recommendation approaches—collaborative filtering and matrix factorization. Its performance is generally superior to both these techniques on two transactional data sets. The relative performance on a very sparse click-stream data set is mixed. Its performance is inferior to that of collaborative filtering and superior to that of matrix factorization for that data set.

Keywords: Data mining, disjunctive rules, personalization, bounce rate, collaborative filtering, matrix factorization

Suggested Citation

Ghoshal, Abhijeet and Sarkar, Sumit, Association Rules for Recommendations with Multiple Items (March 06, 2014). Abhijeet Ghoshal, Sumit Sarkar (2014) Association Rules for Recommendations with Multiple Items. INFORMS Journal on Computing 26(3):433-448, Available at SSRN: https://ssrn.com/abstract=3724726

Abhijeet Ghoshal (Contact Author)

University of Illinois at Urbana-Champaign - Department of Business Administration ( email )

1206 South Sixth Street
Champaign, IL 61820
United States

Sumit Sarkar

University of Texas at Dallas - Department of Information Systems & Operations Management ( email )

P.O. Box 830688
Richardson, TX 75083-0688
United States
972-883-6854 (Phone)
972-883-6811 (Fax)

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
36
Abstract Views
290
PlumX Metrics