4.5 Article

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

期刊

TECHNOMETRICS
卷 63, 期 2, 页码 171-183

出版社

TAYLOR & FRANCIS INC
DOI: 10.1080/00401706.2020.1733094

关键词

Adaptive weight; Classification; Network lasso; Segmentation

向作者/读者索取更多资源

In the pricing of customized products, accurately predicting the purchase behavior of different customers for personalized requests is challenging, requiring the construction of distinct models for data analysis. An adaptive convex clustering method is proposed to segment data and fit models simultaneously, ensuring data points with similar model structures are grouped together.
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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据