Evidence map›Paper›PMID 36454766›Full record

ArticlePloS one2022

Intelligent personalized shopping recommendation using clustering and supervised machine learning algorithms.

Nail Chabane, Achraf Bouaoune, Reda Tighilt, Moloud Abdar, Alix Boc, Etienne Lord, Nadia Tahiri, Bogdan Mazoure, U Rajendra Acharya, Vladimir Makarenkov

Abstract read
In one paragraph

Article in PloS one, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Review
  2. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

10 authors.

Nail ChabaneDepartment of Computer Science, Université du Québec à Montréal, Montreal, QC, Canada.
Achraf BouaouneDepartment of Computer Science, Université du Québec à Montréal, Montreal, QC, Canada.
Reda TighiltDepartment of Computer Science, Université du Québec à Montréal, Montreal, QC, Canada.
Moloud AbdarInstitute for Intelligent Systems Research and Innovation, Deakin University, Geelong, Victoria, Australia.
Alix BocDepartment of Computer Science, Université du Québec à Montréal, Montreal, QC, Canada.
Etienne LordDepartment of Computer Science, Université du Québec à Montréal, Montreal, QC, Canada.ORCID 0000-0002-3834-6096
Nadia TahiriUniversity of Sherbrooke, Sherbrooke, QC, Canada.
Bogdan MazoureSchool of Computer Science, McGill University, Montreal, QC, Canada.
U Rajendra AcharyaDepartment of Electronics and Computer Engineering, Ngee Ann Polytechnic, Singapore, Singapore.
Vladimir MakarenkovDepartment of Computer Science, Université du Québec à Montréal, Montreal, QC, Canada.ORCID 0000-0003-3753-5925

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Next basket recommendation is a critical task in market basket data analysis. It is particularly important in grocery shopping, where grocery lists are an essential part of shopping habits of many customers. In this work, we first present a new grocery Recommender System available on the MyGroceryTour platform. Our online system uses different traditional machine learning (ML) and deep learning (DL) algorithms, and provides recommendations to users in a real-time manner. It aims to help Canadian customers create their personalized intelligent weekly grocery lists based on their individual purchase histories, weekly specials offered in local stores, and product cost and availability information. We perform clustering analysis to partition given customer profiles into four non-overlapping clusters according to their grocery shopping habits. Then, we conduct computational experiments to compare several traditional ML algorithms and our new DL algorithm based on the use of a gated recurrent unit (GRU)-based recurrent neural network (RNN) architecture. Our DL algorithm can be viewed as an extension of DREAM (Dynamic REcurrent bAsket Model) adapted to multi-class (i.e. multi-store) classification, since a given user can purchase recommended products in different grocery stores in which these products are available. Among traditional ML algorithms, the highest average F-score of 0.516 for the considered data set of 831 customers was obtained using Random Forest, whereas our proposed DL algorithm yielded the average F-score of 0.559 for this data set. The main advantage of the presented Recommender System is that our intelligent recommendation is personalized, since a separate traditional ML or DL model is built for each customer considered. Such a personalized approach allows us to outperform the prediction results provided by general state-of-the-art DL models.

Indexed as

AlgorithmsSupervised Machine LearningCanadaCluster AnalysisMachine Learning

Identifiers

PMID36454766
PMCPMC9714752

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.