arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.01417stat.MLcs.LG
收藏

广义逐点线性回归算法

Algorithms for Generalized Cluster-wise Linear Regression

Southern Methodist University(南卫理公会大学);Sears Holdings Corporation(西尔斯控股公司);Northwestern University(西北大学);Ernst & Young LLP(安永会计师事务所)

Young Woong Park, Yan Jiang, Diego Klabjan, Loren Williams

摘要:

逐点线性回归(multi-wise linear regression,缩写为SVM)是一种与回归交织在一起的聚类问题,它是为了找到实体的聚类,使得在这些聚类上执行的回归的平方误差的总和最小化,其中每个聚类可能具有不同的方差。我们通过允许每个实体有多个观察来推广这个问题,并将其称为广义的问题。我们提出了一个精确的数学规划为基础的方法依赖于列生成,列生成为基础的启发式算法,聚类预定义的实体组,一个元启发式遗传算法与适应劳埃德算法的K-均值聚类,两阶段的方法,和一个改进的算法的Sp{ä}th \cite{Spath1979}求解广义聚类。我们研究了我们的算法的性能,在预测晕和同类相食的影响,在促销活动中使用现实世界的零售数据从一个大型连锁超市的库存单位(ESTA)聚类问题。在库存聚类问题中,零售商需要根据促销的季节效应对SKU进行聚类。季节性效应是回归的结果,预测因子是促进机制和季节性假人在生成的集群上进行。我们比较了所有提出的算法的性能与现实世界和合成数据的问题。

英文摘要:

Cluster-wise linear regression (CLR), a clustering problem intertwined with regression, is to find clusters of entities such that the overall sum of squared errors from regressions performed over these clusters is minimized, where each cluster may have different variances. We generalize the CLR problem by allowing each entity to have more than one observation, and refer to it as generalized CLR. We propose an exact mathematical programming based approach relying on column generation, a column generation based heuristic algorithm that clusters predefined groups of entities, a metaheuristic genetic algorithm with adapted Lloyd's algorithm for K-means clustering, a two-stage approach, and a modified algorithm of Sp{ä}th \cite{Spath1979} for solving generalized CLR. We examine the performance of our algorithms on a stock keeping unit (SKU) clustering problem employed in forecasting halo and cannibalization effects in promotions using real-world retail data from a large supermarket chain. In the SKU clustering problem, the retailer needs to cluster SKUs based on their seasonal effects in response to promotions. The seasonal effects are the results of regressions with predictors being promotion mechanisms and seasonal dummies performed over clusters generated. We compare the performance of all proposed algorithms for the SKU problem with real-world and synthetic data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑