Graph-Based Structures for the Market Baskets Analysis

the market basket is defined as an itemset bought together by a customer on a single visit to a store. the market basket analysis is a powerful tool for the implementation of cross-selling strategies. although some algorithms can find the market basket, they can be inefficient in computational time. the aim of this paper is to present a faster algorithm for the market basket analysis using data-condensed structures. in this innovative approach, the condensed data is obtained by transforming the market basket problem in a maximum-weighted clique problem. firstly, the input data set is transformed into a graph-based structure and then the maximum-weighted clique problem is solved using a meta-heuristic approach in order to find the most frequent itemsets. the computational results show accurate solutions with reduced computational times.