SciELO - Scientific Electronic Library Online

 
vol.24 issue2Scheduling variable processing time operations in systems with buffersHeuristic Sensitivity Analysis for Baker's Yeast Model Parameters author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Investigação Operacional

Print version ISSN 0874-5161

Abstract

CAVIQUE, Luís. Graph-Based Structures for the Market Baskets Analysis. Inv. Op. [online]. 2004, vol.24, n.2, pp.233-246. ISSN 0874-5161.

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.

Keywords : data mining; market basket; similarity measures; maximum clique problem.

        · text in English     · English ( pdf )