Data Analysis of Tyre Quality Based on Improved FP-Growth Algorithm

被引:5
|
作者
Li M. [1 ,2 ]
Ding D. [1 ]
Yi Y. [1 ]
机构
[1] Software School, Fudan University, Shanghai
[2] Shanghai Key Laboratory of Data Science, Fudan University, Shanghai
关键词
Data mining; FP-growth algorithm; Industrial big data; Quality analysis;
D O I
10.3969/j.issn.1004-132X.2019.02.017
中图分类号
学科分类号
摘要
According to the problem analyses of abnormal quality in tyre manufacturing processes, tyre quality data acquisition, effective integration and data analysis processes were discussed. The structured data sets associated with production data and product inspection data were constructed based on Hive data warehouse. For the existing frequent pattern-growth (FP-Growth) algorithm, the performance of FP-tree was low, an improved FP-growth algorithm was proposed. A new tail attribute was added to the existing header table of frequent item and accelerate the construction of FP-tree. The experiments show that the improved FP-growth algorithm may effectively improve the correlation analysis efficiency of tyre quality abnormal data. The improved FP-growth algorithm is able to identify the factors that affect the quality of tire productions, and it is also suitable for large data mining. © 2019, China Mechanical Engineering Magazine Office. All right reserved.
引用
收藏
页码:244 / 251
页数:7
相关论文
共 13 条
  • [1] Li M., Wang H., Chen S., Et al., Data Analysis of Industrial Big Data and Sales Forecast of Tyre Industry, Computer Engineering and Applications, 53, 11, pp. 100-109, (2017)
  • [2] Liu Q., Qin S., Perspectives on Big Data Modeling of Process Industries, ACTA Automatica SINICA, 42, 2, pp. 161-171, (2016)
  • [3] Yan J., Meng Y., Lu L., Et al., Industrial Big Data in an Industry 4.0 Environment: Challenges, Schemes and Applications for Predictive Maintenance, IEEE Access, 5, pp. 23484-23491, (2017)
  • [4] Zhang J., Gao L., Qin W., Et al., Big-data-driven Operational Analysis and Decision-making Methodology in Intelligent Workshop, Computer Integrated Manufacturing Systems, 22, 5, pp. 1220-1228, (2016)
  • [5] Yang L.P., Wang F.Z., Wang T., Analysis of Dishonorable Behavior on Railway Online Ticketing System Based on K-means and FP-growth, IEEE International Conference on Information and Automation, pp. 1173-1177, (2017)
  • [6] Agrawal R., Imielinski T., Swami A., Mining Association Rules between Sets of Items in Large Databases, Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207-216, (1993)
  • [7] Pei J., Han J., Mao R., An Efficient Algorithm for Mining Frequent Closed Itemsets, ACM-SIGMOD Workshop on Data Mining and Knowledge Discovery, pp. 146-148, (2000)
  • [8] Gouda K., Zai M.J., Efficiently Mining Maximal Frequent Itemsets, IEEE International Conference on Data Mining, pp. 163-170, (2001)
  • [9] Han J., Pei J., Yin Y., Mining Frequent Patterns without Candidate Generation, ACM SIGMOD Record, 29, 2, pp. 1-12, (2000)
  • [10] Ling X., Wang S., Li Y., Et al., No-header-table FP-Growth Algorithm, Journal of Computer Applications, 31, 5, pp. 1391-1394, (2001)