Adaptive Convex Clustering of Generalized Linear Models With Application in Purchase Likelihood Prediction

被引:8
作者
Chu, Shuyu [1 ]
Jiang, Huijing [1 ]
Xue, Zhengliang [1 ]
Deng, Xinwei [2 ]
机构
[1] IBM TJ Watson Res Ctr, Yorktown Hts, NY USA
[2] Virginia Tech, Dept Stat, Blacksburg, VA 24061 USA
关键词
Adaptive weight; Classification; Network lasso; Segmentation; LASSO;
D O I
10.1080/00401706.2020.1733094
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
In the pricing of customized products, it is challenging to accurately predict the purchase likelihood of potential clients for each personalized request. The heterogeneity of customers and their responses to the personalized products leads to very different purchase behavior. Thus, it is often not appropriate to use a single model to analyze all the pricing data. There is a great need to construct distinctive models for different data segments. In this work, we propose an adaptive convex clustering method to perform data segmentation and model fitting simultaneously for generalized linear models. The proposed method segments data points using the fused penalty to account for the similarity in model structures. It ensures that the data points sharing the same model structure are grouped into the same segment. Accordingly, we develop an efficient algorithm for parameter estimation and study its consistency properties in estimation and clustering. The performance of our approach is evaluated by both numerical examples and case studies of real business data.
引用
收藏
页码:171 / 183
页数:13
相关论文
共 28 条
[1]   Distributed optimization and statistical learning via the alternating direction method of multipliers [J].
Boyd S. ;
Parikh N. ;
Chu E. ;
Peleato B. ;
Eckstein J. .
Foundations and Trends in Machine Learning, 2010, 3 (01) :1-122
[2]   Convex Clustering: An Attractive Alternative to Hierarchical Clustering [J].
Chen, Gary K. ;
Chi, Eric C. ;
Ranola, John Michael O. ;
Lange, Kenneth .
PLOS COMPUTATIONAL BIOLOGY, 2015, 11 (05)
[3]   Splitting Methods for Convex Clustering [J].
Chi, Eric C. ;
Lange, Kenneth .
JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 2015, 24 (04) :994-1013
[4]  
Diamond S, 2016, J MACH LEARN RES, V17
[5]   Network Lasso: Clustering and Optimization in Large Graphs [J].
Hallac, David ;
Leskovec, Jure ;
Boyd, Stephen .
KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2015, :387-396
[6]  
Hartigan J. A., 1979, Applied Statistics, V28, P100, DOI 10.2307/2346830
[7]  
Hocking T.D., 2011, P 28 INT C MACHINE L, P745
[8]  
Jiang H., 2012, SDM, P506, DOI [10.1137/1.9781611972825.44, DOI 10.1137/1.9781611972825.44]
[9]   HIERARCHICAL CLUSTERING SCHEMES [J].
JOHNSON, SC .
PSYCHOMETRIKA, 1967, 32 (03) :241-254
[10]  
Jose C., 2013, ICML, P486