This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Application in Market Basket Research Based on FP-Growth Algorithm
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
Market basket analysis gives us insight into the merchandise by telling us which products tend to be purchased together and which are most enable to purchase. The market basket analysis is a powerful tool especially in retailing it is essential to discover large baskets, since it deals with thousands of items. FP-growth algorithm is an efficient algorithm for mining frequent patterns. It does not need to produce the candidate sets and that is quite time consuming. It scans database only twice and frequent item set is mining by using of FP tree. In this paper, Visual C++ is applied to design the program to mine the frequent item sets using FP-growth algorithm. According to the mining result, the merchandise in the supermarket is arranged together in the same place well-suited for customer.
Citation:
Liu Yongmei, Guan Yong, "Application in Market Basket Research Based on FP-Growth Algorithm," csie, vol. 4, pp.112-115, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.