Efficient Market Basket Analysis based on FP-Bonsai

被引:0
作者
Gayathri, Behera [1 ]
机构
[1] GITAM Univ, GITAM Inst Technol, Dept Comp Sci & Engn, Visakhapatnam, Andhra Pradesh, India
来源
2017 INTERNATIONAL CONFERENCE ON I-SMAC (IOT IN SOCIAL, MOBILE, ANALYTICS AND CLOUD) (I-SMAC) | 2017年
关键词
market basket analysis; FP-Bonsai; Mining Frequent Itemsets; FP-growth;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The market basket analysis is a powerful tool especially in retailing as it deals with thousands of items and it becomes essential to discover large baskets. Market basket analysis analyzes the buying habits of customers as to which products are tend to be purchased together. The discovery of these associations helps the retailers to develop marketing strategies, make business decisions and maximize the profits. Several strategies have been proposed to push several types of constraints within the most well known algorithms in the context of mining frequent itemsets. In the present paper an effective FP-Bonsai algorithm is implemented for mining frequent patterns. According to the mining result, the products are arranged together to well-suite the customer's needs and interests. FP-bonsai algorithm results in a very efficient frequent itemset mining algorithm that effectively exploits monotone constraints. The use of FP-bonsai instead of the traditional FP-growth algorithm increases the efficiency and reduces the execution time to discover the frequent patterns.
引用
收藏
页码:788 / 792
页数:5
相关论文
共 13 条
  • [1] Agrawal R., P 20 INT C VERY LARG
  • [2] [Anonymous], 2000, P C MAN DAT SIGMOD 0
  • [3] [Anonymous], 1996, ADV KNOWLEDGE DISCOV
  • [4] Bonchi F., P ICDM 03
  • [5] Bonchi F., P PKDD03
  • [6] Bonchi Francesco, FP BONSAI ART GROWIN
  • [7] Bucila C., P ACM SIGKDD 02
  • [8] Han J., P ACM SIGMOD 00
  • [9] Han J., 2006, Data mining: Concepts and Techniques
  • [10] Liu Yongmei, 2008, APPL MARKET BASKET A