Eirini Ntoutsi
Kostas Stefanidis
ABSTRACT
Nowadays, WWW brings overwhelming variety of choices to consumers. Recommendation systems facilitate the selection by issuing recommendations to them. Recommendations for users, or groups, are determined by considering users similar to the users in question. Scanning the whole database for locating similar users, though, is expensive. Existing approaches build cluster models 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-tolerant subspace clustering approach. We extend the concept of fault tolerance to density-based subspace clustering, and to speed up our algorithms, we introduce the significance threshold for considering only promising dimensions for subspace extension. Moreover, as we potentially receive a multitude of users from subspace clustering, we propose a weighted ranking approach to refine the set of like-minded users. Our experiments on real movie datasets show that the diversification of the similar users that the subspace clustering approaches offer results in better recommendations compared to traditional collaborative filtering and full-dimensional clustering approaches.
- N. Agarwal, E. Haque, H. Liu, and L. Parsons. Research paper recommender systems: A subspace clustering approach. In WAIM, 2005. Google Scholar
Digital Library
- R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In SIGMOD, 1998. Google ScholarDigital Library
- S. Amer-Yahia, S. B. Roy, A. Chawla, G. Das, and C. Yu. Group recommendation: Semantics and efficiency. PVLDB, 2(1):754--765, 2009. Google ScholarDigital Library
- A. Boutet, A.-M. Kermarrec, D. A. Frey, R. Guerraoui, and A. Jegou. Whatsup: A decentralized instant news recommender. In IPDPS, 2013. Google ScholarDigital Library
- W. Dong, M. Charikar, and K. Li. Efficient k-nearest neighbor graph construction for generic similarity measures. In WWW, 2011. Google ScholarDigital Library
- M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD, 1996.Google ScholarDigital Library
- S. Günnemann, E. Müller, S. Raubach, and T. Seidl. Flexible fault tolerant subspace clustering for data with missing values. In ICDM, 2011.Google ScholarDigital Library
- K. Kailing, H.-P. Kriegel, and P. Kröger. Density-connected subspace clustering for high-dimensional data. In SIAM, 2004.Google Scholar
- J. A. Konstan, B. N. Miller, D. Maltz, J. L. Herlocker, L. R. Gordon, and J. Riedl. Grouplens: Applying collaborative filtering to usenet news. Commun. ACM, 40(3):77--87, 1997. Google ScholarDigital Library
- G. Koutrika, B. Bercovitz, and H. Garcia-Molina. Flexrecs: expressing and combining exible recommendations. In SIGMOD, 2009. Google ScholarDigital Library
- H.-P. Kriegel, P. Kröger, and A. Zimek. Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Trans. Knowl. Discov. Data, 3(1):1:1--1:58, Mar. 2009. Google ScholarDigital Library
- X. Li and T. Murata. Using multidimensional clustering based collaborative filtering approach improving recommendation diversity. In Web Intelligence/IAT Workshops, 2012. Google ScholarDigital Library
- R. J. Mooney and L. Roy. Content-based book recommending using learning for text categorization. In ACM DL, 2000. Google ScholarDigital Library
- E. Ntoutsi, K. Stefanidis, K. Nørvåg, and H.-P. Kriegel. Fast group recommendations by applying user clustering. In ER, 2012. Google ScholarDigital Library
- K. Rausch, E. Ntoutsi, K. Stefanidis, and H.-P. Kriegel. Exploring subspace clustering for recommendations. In SSDBM, 2014. Google ScholarDigital Library
- K. Stefanidis, M. Drosou, and E. Pitoura. You May Also Like results in relational databases. In PersDB, 2009.Google Scholar
- K. Stefanidis, E. Ntoutsi, M. Petropoulos, K. Nørvåg, and H.-P. Kriegel. A framework for modeling, computing and presenting time-aware recommendations. T. Large-Scale Data- and Knowledge-Centered Systems, 10:146--172, 2013.Google Scholar
- L. Xiang, Q. Yuan, S. Zhao, L. Chen, X. Zhang, Q. Yang, J. Sun, and J. Sun. Temporal recommendation on graphs via long- and short-term preference fusion. In KDD, 2010. Google ScholarDigital Library
Index Terms
- "Strength Lies in Differences": Diversifying Friends for Recommendations through Subspace Clustering
Recommendations
A new method to find neighbor users that improves the performance of Collaborative Filtering
Highlights- We propose a new neighbors finding method for CF based on subspace clustering.
- ...
AbstractRecommender Systems (RS) are used to help people reduce the amount of time they spend to find the items they are looking for. One of the most successful techniques used in RS is called Collaborative Filtering (CF). It looks into the ...
One-step kernelized sparse clustering on grassmann manifolds
AbstractSparse Subspace Clustering (SSC) based clustering methods have achieved great success since these methods could effectively explore the low-dimensional subspace structure embedded in the original data. However, most existing subspace clustering ...
Diversification and refinement in collaborative filtering recommender
CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge managementThis paper considers a popular class of recommender systems that are based on Collaborative Filtering (CF) and proposes a novel technique for diversifying the recommendations that they give to users. Items are clustered based on a unique notion of ...
Comments