Prediction of User's Purchase Intention Based on Machine Learning

被引:1
作者
Liu Bing [1 ]
Shi Yuliang [1 ]
机构
[1] Beijing Univ Technol, Sch Software Engn, Beijing, Peoples R China
来源
2016 3RD INTERNATIONAL CONFERENCE ON SOFT COMPUTING & MACHINE INTELLIGENCE (ISCMI 2016) | 2016年
关键词
machine learning; decision tree; prediction and classification; localstorage;
D O I
10.1109/ISCMI.2016.21
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In recent years, the use of machine learning methods to deal with the problem of user interest prediction has become a hot research direction in the field of electronic commerce. In the present stage, a naive Bayesian algorithm has the advantages of simple implementation and high classification efficiency. However, this method is too dependent on the distribution of samples in the sample space, and has the potential of instability. To this end, the decision tree method is introduced to deal with the problem of interest classification, and the innovative use of Localstorage technology in HTML5 to obtain the required the experimental data. Classification method uses the information entropy of the training data set to build the classification model, through the simple search of the classification model to complete the classification of unknown data items. Both theoretical analysis and experimental results show that the decision tree is used to deal with the problem of prediction of users' interests has obvious advantages in the efficiency and stability.
引用
收藏
页码:99 / 103
页数:5
相关论文
共 7 条
[1]  
[Anonymous], 2004, P 4 ACM SIGCOMM C IN, DOI DOI 10.1145/1028788.1028805
[2]  
Jia Chenguang, 2016, J CHINESE AGR MECH, P2
[3]  
Mei Wang, 2009, CHINESE NURSING RES, V11, P2
[4]  
Min Fan, 2015, ANAL RES EXCELLENT R, P2
[5]  
PANG N T, 2011, INTRO DATA MINING, P27
[6]   Implementation of neural network based non-linear predictive control [J].
Sorensen, PH ;
Norgaard, M ;
Ravn, O ;
Poulsen, NK .
NEUROCOMPUTING, 1999, 28 :37-51
[7]  
Zuev D, 2005, LECT NOTES COMPUT SC, V3431, P321, DOI 10.1007/978-3-540-31966-5_25