ACM Home Page
Please provide us with feedback. Feedback
Grocery shopping recommendations based on basket-sensitive random walk
Full text MovMov (15:22),  PdfPdf (688 KB)
Source
International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Paris, France
SESSION: Industrial track papers table of contents
Pages 1215-1224  
Year of Publication: 2009
ISBN:978-1-60558-495-9
Authors
Ming Li  Unilever Discover R&D (Colworth), Sharnbrook, Bedford, United Kingdom
Benjamin M. Dias  Unilever Discover R&D (Colworth), Sharnbrook, Bedford, United Kingdom
Ian Jarman  Liverpool John Moores University, Liverpool, United Kingdom
Wael El-Deredy  University of Manchester, Manchester, United Kingdom
Paulo J.G. Lisboa  Liverpool John Moores University, Liverpool, United Kingdom
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 47,   Downloads (12 Months): 151,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1557019.1557150
What is a DOI?

ABSTRACT

We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies, books and music) with non-repeated purchases. In grocery shopping, however, consumers will make multiple purchases of the same or very similar products more frequently than buying entirely new items. The proposed recommendation scheme offers several advantages in addressing the grocery shopping problem, namely: 1) a product similarity measure that suits a domain where no rating information is available; 2) a basket sensitive random walk model to approximate product similarities by exploiting incomplete neighborhood information; 3) online adaptation of the recommendation based on the current basket and 4) a new performance measure focusing on products that customers have not purchased before or purchase infrequently. Empirical results benchmarking on three real-world data sets demonstrate a performance improvement of the proposed method over other existing collaborative filtering models.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
J. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, 1998.
3
 
4
5
6
 
7
 
8
D. Z. Huang, Z. and H. Chen. A link analysis approach to recommendation with sparse data. In Americas Conference on Information Systems, New York, NY, USA, 2004.
9
 
10
11
12
13
14
15
 
16
 
17
C. M. Sordo-Garcia, M. B. Dias, M. Li, W. El-Deredy, and P. J. G. Lisboa. Evaluating retail recommender systems via retrospective data: Lessons learnt from a live-intervention study. In The 2007 International Conference on Data Mining, DMIN'07, 2007.
18
19
 
20
T. Zhou, J. Ren, M. Medo, and Y. C. Zhang. Bipartite network projection and personal recommendation. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), 76(4), 2007.

Collaborative Colleagues:
Ming Li: colleagues
Benjamin M. Dias: colleagues
Ian Jarman: colleagues
Wael El-Deredy: colleagues
Paulo J.G. Lisboa: colleagues