检查二元变量的任何组合是否相关/对序数因变量有影响

发布于 2025-01-09 20:27:08 字数 910 浏览 1 评论 0原文

我正在研究一个案例来完成我的(不是那么高级的)数据科学家课程,这里的主题已经给我带来了很多帮助,谢谢! 不幸的是,现在我再次陷入困境,无法找到现有的答案。

我的数据来自一家自行车商店,我想了解客户首次注册购买期间购买的产品是否与它们未来对商店的重要性相关/有影响。我将客户分为 5 类(从注册后从未再注册购买的人,到花很少钱购买 2-3 次的人,花大钱购买几次的人,到定期购买东西的人)确实给这家自行车店带来了很多钱),我已将它们订购为序数因变量。

作为自变量,我准备了 20 多个二元变量,用于标识首次从该商店购买(作为注册客户首次购买)期间购买的产品/服务。每个客户一行。因此,我想检查一下是否有产品组合(可能是自行车购买的“额外”)可以增加客户注册并希望在未来保持忠诚客户的机会。

梦想可以说,例如,如果您在第一次购买时购买了一辆便宜或中便宜的自行车,从长远来看,您可能不会为自行车店做出太多贡献,因此您的依赖等级较低多变的。但那些购买中等廉价自行车、头盔和锁(可能以特价)的人更有可能成为长期赚钱的忠实注册客户之一。

可能没有这样的关系,但无论如何我想测试一下。结果的实施可能能够在购买期间推荐额外的产品(价格优惠)。

我在这门课程中学习 R。我们经历了一些技术,首先我想象可以使用神经网络(只是因为它听起来最有趣),将所有这些产品作为稀疏矩阵的输入,并将客户集群作为输出(我希望它与我读到的稀疏矩阵的示例类似,稀疏矩阵以图片中的像素作为输入,数字 1-9 作为输出),但后来我被告知这实际上是基于图片和真实模式,在我的例子中我也不知道有没有。

然后我想我可以尝试使用序数森林。但它并不能很好地预测我的集群,根本不能(五分之二的集群没有得到预测)。不过没关系,我不指望第一次购买就能预测所有客户的未来。但我真的很想看看是否有产品组合可以增加客户最终进入忠诚度“较高”集群之一的机会。

我不确定这是否足够清楚。 :) 你认为有什么方法可以测试我的想法吗?我可以尝试做什么?如果您需要更多信息,请告诉我。

I am working on a case to finish my (not so advanced) data scientist course and I have already been helped a lot by topics here, thanks!
Unfortunately now I am stuck again and cannot find an existing answer.

My data comes from a bike shop and I want to see if products bought during customers' first registered purchase are related to/have impact on how important they will become to the shop in the future. I have grouped customers into 5 clusters (from those who registered and made never any registered purchase again, through these who made 2-3 purchases for little money, those who made a few purchases for a lot of money to those who purchase stuff regularly and really bring a lot of money to this bike shop), I have ordered them into an ordinal dependent variable.

As the independent variables I have prepared 20+ binary variables that identify products/services bought during the first purchase from this shop (first purchase as a registered customer). One row per customer. So I want to check the idea if there are combinations of products (probably "extras" to the bike purchase) that can increase the chance that a customer would register and hopefully stay as a loyal customer for the future.

The dream would be be able to say, for example, if you buy a cheap or middle-cheap bike during this first purchase you probably don't contribute so much to the bike shop in a long term so you have low grade on the dependent variable. But those who bought a middle-cheap bike AND a helmet AND a lock (probably to special price) are more likely to become one of the loyal registered customers bringing money for a longer time.

There might be no relation like that but I want to test that anyways. Implementation of the result could be being able to recommend an extra product during a purchase (with a good price on it).

I am learning R during this course. We went through some techniques and first I was imagining it would be possible to work with the neural networks (just cause it sounded most fun to try), having all these products as input in the sparse matrix and the customers clusters as the output (I hoped it was similar to the examples I read about with sparse matrix with pixels from a picture as the input and numbers 1-9 as the output) but then I was told that this actually is based on pictures and real patterns and in my case I don't even know if there is any.

Then I was thinking I could try with the ordinal forest. But it doesn't predict my clusters well, not at all (2 out of 5 clusters get no predictions). But that is OK, I don't expect the first purchase to be able to predict all the customers future. But I would really want to see if there are combinations of products that might increase the chance that a customer ends up in one of the "higher" clusters on the loyalty scale.

I am not sure if this was clear enough. :) Do you think that there is any way of testing my idea? What could I try to do? Let me know if you need more information.

如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。

扫码二维码加入Web技术交流群

发布评论

需要 登录 才能够评论, 你可以免费 注册 一个本站的账号。
列表为空,暂无数据
我们使用 Cookies 和其他技术来定制您的体验包括您的登录状态等。通过阅读我们的 隐私政策 了解更多相关信息。 单击 接受 或继续使用网站,即表示您同意使用 Cookies 和您的相关数据。
原文