Characterization of Frequent Online Shoppers using Statistical Learning
with Sparsity
- URL: http://arxiv.org/abs/2111.06057v1
- Date: Thu, 11 Nov 2021 05:36:39 GMT
- Title: Characterization of Frequent Online Shoppers using Statistical Learning
with Sparsity
- Authors: Rajiv Sambasivan, Mark Burgess, J\"org Schad, Arthur Keen, Christopher
Woodward, Alexander Geenen, Sachin Sharma
- Abstract summary: This work reports a method to learn the shopping preferences of frequent shoppers to an online gift store by combining ideas from retail analytics and statistical learning with sparsity.
- Score: 54.26540039514418
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Developing shopping experiences that delight the customer requires businesses
to understand customer taste. This work reports a method to learn the shopping
preferences of frequent shoppers to an online gift store by combining ideas
from retail analytics and statistical learning with sparsity. Shopping activity
is represented as a bipartite graph. This graph is refined by applying
sparsity-based statistical learning methods. These methods are interpretable
and reveal insights about customers' preferences as well as products driving
revenue to the store.
Related papers
- A Benchmark for Fairness-Aware Graph Learning [58.515305543487386]
We present an extensive benchmark on ten representative fairness-aware graph learning methods.
Our in-depth analysis reveals key insights into the strengths and limitations of existing methods.
arXiv Detail & Related papers (2024-07-16T18:43:43Z) - Retail store customer behavior analysis system: Design and
Implementation [2.215731214298625]
We propose a framework that includes three primary parts: mathematical modeling of customer behaviors, behavior analysis using an efficient deep learning based system, and individual and group behavior visualization.
Each module and the entire system were validated using data from actual situations in a retail store.
arXiv Detail & Related papers (2023-09-05T06:26:57Z) - Protecting User Privacy in Online Settings via Supervised Learning [69.38374877559423]
We design an intelligent approach to online privacy protection that leverages supervised learning.
By detecting and blocking data collection that might infringe on a user's privacy, we can restore a degree of digital privacy to the user.
arXiv Detail & Related papers (2023-04-06T05:20:16Z) - FilFL: Client Filtering for Optimized Client Participation in Federated Learning [71.46173076298957]
Federated learning enables clients to collaboratively train a model without exchanging local data.
Clients participating in the training process significantly impact the convergence rate, learning efficiency, and model generalization.
We propose a novel approach, client filtering, to improve model generalization and optimize client participation and training.
arXiv Detail & Related papers (2023-02-13T18:55:31Z) - A Hybrid Statistical-Machine Learning Approach for Analysing Online
Customer Behavior: An Empirical Study [2.126171264016785]
We develop a hybrid interpretable model to analyse 454,897 online customers' behavior for a particular product category at the largest online retailer in China, that is JD.
Our results reveal that customers' product choice is insensitive to the promised delivery time, but this factor significantly impacts customers' order quantity.
We identify product classes for which certain discounting approaches are more effective and provide recommendations on better use of different discounting tools.
arXiv Detail & Related papers (2022-12-01T19:37:29Z) - Aggregated Customer Engagement Model [0.571097144710995]
E-commerce websites use machine learned ranking models to serve shopping results to customers.
New or under-impressed products do not have enough customer engagement signals and end up at a disadvantage when being ranked alongside popular products.
We propose a novel method for data curation that aggregates all customer engagements within a day for the same query to use as input training data.
arXiv Detail & Related papers (2021-08-17T20:58:10Z) - OPAM: Online Purchasing-behavior Analysis using Machine learning [0.8121462458089141]
We present a customer purchasing behavior analysis system using supervised, unsupervised and semi-supervised learning methods.
The proposed system analyzes session and user-journey level purchasing behaviors to identify customer categories/clusters.
arXiv Detail & Related papers (2021-02-02T17:29:52Z) - Categorizing Online Shopping Behavior from Cosmetics to Electronics: An
Analytical Framework [3.6726589459214445]
The proposed framework is extendable to other large e-commerce data sets to obtain automated purchase predictions and descriptive consumer insights.
The proposed system achieves 97-99% classification accuracy and recall for user-journey level purchase predictions.
arXiv Detail & Related papers (2020-10-06T06:16:44Z) - Face to Purchase: Predicting Consumer Choices with Structured Facial and
Behavioral Traits Embedding [53.02059906193556]
We propose to predict consumers' purchases based on their facial features and purchasing histories.
We design a semi-supervised model based on a hierarchical embedding network to extract high-level features of consumers.
Our experimental results on a real-world dataset demonstrate the positive effect of incorporating facial information in predicting consumers' purchasing behaviors.
arXiv Detail & Related papers (2020-07-14T06:06:41Z) - Automatic Validation of Textual Attribute Values in E-commerce Catalog
by Learning with Limited Labeled Data [61.789797281676606]
We propose a novel meta-learning latent variable approach, called MetaBridge.
It can learn transferable knowledge from a subset of categories with limited labeled data.
It can capture the uncertainty of never-seen categories with unlabeled data.
arXiv Detail & Related papers (2020-06-15T21:31:05Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.