基于深度LightGBM集成学习模型的谷歌商店顾客购买力预测

doi:10.11772/j.issn.1001-9081.2019071305

摘要
图/表
参考文献
相关文章 (15)

全文: PDF (892 KB) HTML
输出: BibTeX | EndNote (RIS)

摘要针对轻量化梯度促进机（LightGBM）等集成学习模型只对数据信息进行一次挖掘，无法自动地细化数据挖掘粒度或通过深入挖掘得到更多的数据中潜在内部关联信息的问题，提出了深度LightGBM集成学习模型，该模型由滑动窗口和加深两部分组成。首先，通过滑动窗口使得集成学习模型能够自动地细化数据挖掘粒度，从而更加深入地挖掘数据中潜在的内部关联信息，同时赋予模型一定的表示学习能力。然后，基于滑动窗口，用加深步骤进一步地提升模型的表示学习能力。最后，结合特征工程对数据集进行处理。在谷歌商店数据集上进行的实验结果表明，所提深度集成学习模型相较原始集成学习模型的预测精度高出6.16个百分点。所提方法能够自动地细化数据挖掘粒度，从而获取更多数据集中的潜在信息，并且深度LightGBM集成学习模型与传统深度神经网络相比是非神经网络的深度模型，参数更少，可解释性更强。

	服务

	把本文推荐给朋友
	加入我的书架
	加入引用管理器
	E-mail Alert
	RSS
	作者相关文章
	叶志宇
	冯爱民
	高航

关键词 ：机器学习, 轻量化梯度促进机, 数据挖掘, 深度模型, 集成学习, 特征工程

Abstract：The ensemble learning models such as Light Gradient Boosting Machine (LightGBM) only mine data information once, and cannot automatically refine the granularity of data mining or obtain more potential internal correlation information in the data by deep digging. In order to solve the problems, a deep LightGBM ensemble learning model was proposed, which was composed of sliding window and deepening. Firstly, the ensemble learning model was able to automatically refine the granularity of data mining through the sliding window, so as to further mine the potential internal correlation information in the data and a certain expressive learning ability was given to the model. Secondly, based on the sliding window, the deepening step was used to further improve the representation learning ability of the model. Finally, the dataset was processed with feature engineering. The experimental results on the dataset of Google store show that, the prediction accuracy of the proposed deep ensemble learning model is 6.16 percentage points higher than that of original ensemble learning model. The proposed method can automatically refine the granularity of data mining, so as to obtain more potential information in the dataset. Moreover, compared with the traditional deep neural network, the deep LightGBM ensemble learning model has fewer parameters and better interpretability as a non-neural network.

Key words： machine learning Light Gradient Boosting Machine (LightGBM) data mining deep model ensemble learning feature engineering

收稿日期: 2019-04-29

中图分类号:

TP391.4

作者简介: 叶志宇(1994-),男,福建三明人,硕士研究生,主要研究方向:机器学习、数据挖掘、树模型、深度模型;冯爱民(1971-),女,江苏南京人,副教授,博士,主要研究方向:机器学习、数据挖掘;高航(1964-),男,江苏南京人,副教授,博士,主要研究方向:多媒体技术、嵌入式系统。

引用本文:

叶志宇, 冯爱民, 高航. 基于深度LightGBM集成学习模型的谷歌商店顾客购买力预测[J]. 计算机应用, 2019, 39(12): 3434-3439. YE Zhiyu, FENG Aimin, GAO Hang. Customer purchasing power prediction of Google store based on deep LightGBM ensemble learning model. Journal of Computer Applications, 2019, 39(12): 3434-3439.

链接本文:

http://www.joca.cn/CN/10.11772/j.issn.1001-9081.2019071305 或 http://www.joca.cn/CN/Y2019/V39/I12/3434

[1] OZA N C. Online ensemble learning[C]//Proceedings of the 7th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence. Menlo Park:AAAI Press, 2000:1109.
[2] BREIMAN L. Random forests[J]. Machine Learning, 2001, 45(1):5-32.
[3] KE G, MENG Q, FINLEY T, et al. LightGBM:a highly efficient gradient boosting decision tree[C]//Proceedings of the 2017 Annual Conference on Neural Information Processing Systems. New York:Curran Associates Inc., 2017:3146-3154.
[4] DOROGUSH A V, ERSHOV V, GULIN A. CatBoost:gradient boosting with categorical features support[EB/OL].[2019-03-20]. https://arxiv.org/pdf/1810.11363.pdf.
[5] BREIMAN L. Bagging predictors[J]. Machine Learning, 1996, 24(2):123-140.
[6] GRABNER H, BISCHOF H. On-line boosting and vision[C]//Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Washington, DC:IEEE Computer Society, 2006:260-267.
[7] FRIEDMAN J H. Greedy function approximation:a gradient boosting machine[J]. The Annals of Statistics, 2001, 29(5):1189-1232.
[8] HOCHREITER S, SCHMIDHUBER J. Long short-term memory[J]. Neural Computation, 1997, 9(8):1735-1780.
[9] GRAVES A, FERNÁNDEZ S, SCHMIDHUBER J. Multi-dimen-sional recurrent neural networks[C]//Proceedings of the 2007 International Conference on Artificial Neural Networks, LNCS 4668. Berlin:Springer, 2007:549-558.
[10] BAO W, YUE J, RAO Y. A deep learning framework for financial time series using stacked autoencoders and long-short term memory[J]. PloS One, 2017, 12(7):Article No. e0180944.
[11] SHAO X, MA D, LIU Y, et al. Short-term forecast of stock price of multi-branch LSTM based on K-means[C]//Proceedings of the 2018 International Conference on Systems and Informatics. Piscataway:IEEE, 2018:1546-1551.
[12] SIMONYAN K, ZISSERMAN A. Very deep convolutional networks for large-scale image recognition[EB/OL].[2019-03-20]. https://arxiv.org/pdf/1409.1556.pdf.
[13] BENGIO Y, COURVILLE A, VINCENT P. Representation learning:a review and new perspectives[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2013, 35(8):1798-1828.
[14] ZHOU Z-H, FENG J. Deep forest:towards an alternative to deep neural networks[C]//Proceedings of the 26th International Joint Conference on Artificial Intelligence. Menlo Park:AAAI Press, 2017:3553-3559.
[15] SCOTT S, MATWIN S. Feature engineering for text classification[C]//Proceedings of the 1999 International Machine Learning Conference. San Francisco:Morgan Kaufmann Publishers Inc., 1999:379-388.
[16] CHEN T, GUESTRIN C. XGBoost:a scalable tree boosting system[C]//Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York:ACM, 2016:785-794.
[17] TYREE S, WEINBERGER K Q, AGRAWAL K, et al. Parallel boosted regression trees for Web search ranking[C]//Proceedings of the 2011 International Conference on World Wide Web. New York:ACM, 2011:387-396.
[18] PEDREGOSA F, VAROQUAUX G, GRAMFORT A, et al. Scikit-learn:machine learning in python[J]. Journal of Machine Learning Research, 2011, 12:2825-2830.