Typically, recommendations are computed by considering users similar to the user in question. However, scanning the whole database of users for locating similar users is expensive. Existing approaches build user profiles by employing full-dimensional clustering to find sets of similar users. As the datasets we deal with are high-dimensional and incomplete, full-dimensional clustering is not the best option. To this end, we explore the fault tolerance subspace clustering approach that detects clusters of similar users in subspaces of the original feature space and also allows for missing values. Our experiments on real movie datasets show that the diversification of the similar users through subspace clustering results in better recommendations comparing to traditional collaborative filtering and full dimensional clustering approaches.
[1]
Emmanuel Müller,et al.
Flexible Fault Tolerant Subspace Clustering for Data with Missing Values
,
2011,
2011 IEEE 11th International Conference on Data Mining.
[2]
Dimitrios Gunopulos,et al.
Automatic subspace clustering of high dimensional data for data mining applications
,
1998,
SIGMOD '98.
[3]
Hans-Peter Kriegel,et al.
Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering
,
2009,
TKDD.
[4]
Hans-Peter Kriegel,et al.
Fast Group Recommendations by Applying User Clustering
,
2012,
ER.