Suit Customization Matching Method Based on Improved FP-Growth and K-means Algorithm
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The suit customization enterprise fails to fully utilized the information about customized style. The FP-growth algorithm in the association rule consumes a large amount of memory with low execution efficiency when it comes to multidimensional big data. Aiming at such issues above, this study proposes an improved mining method for the suit customization based on FP-growth and K-means algorithm. It improves the FP-growth algorithm from three aspects: using hash table to establish item header table, replacing traditional FP-tree with ordered FP-tree, and adding imbalance ratio as the new evaluation index. Experimental results show that compared with other association rule algorithms, the improved FP-growth algorithm reduces the memory consumption by about 6.7% and increases the execution efficiency by about 15%. Through the manual review of experimental results, this algorithm can find meaningful association rules attractive to users, verifying the the proposed algorithm.

    Reference
    Related
    Cited by
Get Citation

赵鑫,毋涛.改进FP-growth融合K-means算法的西装定制搭配方法.计算机系统应用,2022,31(6):368-375

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:August 18,2021
  • Revised:September 13,2021
  • Adopted:
  • Online: May 26,2022
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063