Cited By
View all- Xia FAsabere NLiu HChen ZWang W(2017)Socially Aware Conference Participant Recommendation With Personality TraitsIEEE Systems Journal10.1109/JSYST.2014.234237511:4(2255-2266)Online publication date: Dec-2017
A proximity-based fallback model for hybrid web recommender systems
May 2013
Pages 389 - 394
Abstract
Although there are numerous websites that provide recommendation services for various items such as movies, music, and books, most of studies on recommender systems only focus on one specific item type. As recommender sites expand to cover several types of items, though, it is important to build a hybrid web recommender system that can handle multiple types of items.
The switch hybrid recommender model provides a solution to this problem by choosing an appropriate recommender system according to given selection criteria, thereby facilitating cross-domain recommendations supported by individual recommender systems. This paper seeks to answer the question of how to deal with situations where no appropriate recommender system exists to deal with a required type of item. In such cases, the switch model cannot generate recommendation results, leading to the need for a fallback model that can satisfy most users most of the time.
Our fallback model exploits a graph-based proximity search, ranking every entity on the graph according to a given proximity measure. We study how to incorporate the fallback model into the switch model, and propose a general architecture and simple algorithms for implementing these ideas. Finally, we present the results of our research result and discuss remaining challenges and possibilities for future research.
References
[1]
G. Adomavicius and A. Tuzhilin. Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE Trans. on Knowl. and Data Eng., 17(6):734--749, June 2005.
[2]
K. Avrachenkov, N. Litvak, D. Nemirovsky, E. Smirnova, and M. Sokol. Quick detection of top-k personalized pagerank lists. In A. Frieze, P. Horn, and P. PraBat, editors, Algorithms and Models for the Web Graph, volume 6732 of Lecture Notes in Computer Science, pages 50--61. Springer Berlin Heidelberg, 2011.
[3]
A. Balmin, V. Hristidis, and Y. Papakonstantinou. Objectrank: authority-based keyword search in databases. In Proceedings of the Thirtieth international conference on Very large data bases - Volume 30, VLDB '04, pages 564--575. VLDB Endowment, 2004.
[4]
R. Burke. The adaptive web. chapter Hybrid web recommender systems, pages 377--408. Springer-Verlag, Berlin, Heidelberg, 2007.
[5]
A. S. Das, M. Datar, A. Garg, and S. Rajaram. Google news personalization: scalable online collaborative filtering. In Proceedings of the 16th international conference on World Wide Web, WWW '07, pages 271--280, New York, NY, USA, 2007. ACM.
[6]
R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '01, pages 102--113, New York, NY, USA, 2001. ACM.
[7]
R. Goldman, N. Shivakumar, S. Venkatasubramanian, and H. Garcia-Molina. Proximity search in databases. In Proceedings of the 24rd International Conference on Very Large Data Bases, VLDB '98, pages 26--37, San Francisco, CA, USA, 1998. Morgan Kaufmann Publishers Inc.
[8]
M. Gupta, A. Pathak, and S. Chakrabarti. Fast algorithms for topk personalized pagerank queries. In Proceedings of the 17th international conference on World Wide Web, WWW '08, pages 1225--1226, New York, NY, USA, 2008. ACM.
[9]
I. F. Ilyas, G. Beskales, and M. A. Soliman. A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv., 40(4):11:1--11:58, Oct. 2008.
[10]
G. Jeh and J. Widom. Simrank: a measure of structural-context similarity. In Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '02, pages 538--543, New York, NY, USA, 2002. ACM.
[11]
T. Joachims. Training linear svms in linear time. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '06, pages 217--226, New York, NY, USA, 2006. ACM.
[12]
Y. Koren, R. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. Computer, 42(8):30--37, Aug. 2009.
[13]
S. Lee, S. Park, M. Kahng, and S.-g. Lee. Pathrank: a novel node ranking measure on a heterogeneous graph for recommender systems. In Proceedings of the 21st ACM international conference on Information and knowledge management, CIKM '12, pages 1637--1641, New York, NY, USA, 2012. ACM.
[14]
S. Lee, S.-i. Song, M. Kahng, D. Lee, and S.-g. Lee. Random walk based entity ranking on graph for multidimensional recommendation. In Proceedings of the fifth ACM conference on Recommender systems, RecSys '11, pages 93--100, New York, NY, USA, 2011. ACM.
[15]
G. Linden, B. Smith, and J. York. Amazon.com recommendations: Item-to-item collaborative filtering. IEEE Internet Computing, 7(1):76--80, Jan. 2003.
[16]
L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab, November 1999. Previous number = SIDL-WP-1999-0120.
[17]
C. Shi, X. Kong, P. S. Yu, S. Xie, and B. Wu. Relevance search in heterogeneous networks. In Proceedings of the 15th International Conference on Extending Database Technology, EDBT '12, pages 180--191, New York, NY, USA, 2012. ACM.
[18]
Y. Sun, J. Han, X. Yan, P. S. Yu, and T. Wu. Pathsim: Meta path-based top-k similarity search in heterogeneous information networks. In In VLDB' 11, 2011.
Index Terms
- A proximity-based fallback model for hybrid web recommender systems
Recommendations
A Scalable, Accurate Hybrid Recommender System
WKDD '10: Proceedings of the 2010 Third International Conference on Knowledge Discovery and Data MiningRecommender systems apply machine learning techniques for filtering unseen information and can predict whether a user would like a given resource. There are three main types of recommender systems: collaborative filtering, content-based filtering, and ...
Investigating serendipity in recommender systems based on real user feedback
SAC '18: Proceedings of the 33rd Annual ACM Symposium on Applied ComputingOver the past several years, research in recommender systems has emphasized the importance of serendipity, but there is still no consensus on the definition of this concept and whether serendipitous items should be recommended is still not a well-...
Hybrid Recommender Systems: Survey and Experiments
Recommender systems represent user preferences for the purpose of suggesting items to purchase or examine. They have become fundamental applications in electronic commerce and information access, providing suggestions that effectively prune large ...
Comments
Information & Contributors
Information
Published In
May 2013
1636 pages
ISBN:9781450320382
DOI:10.1145/2487788
- General Chairs:
- Daniel Schwabe,
- Virgílio Almeida,
- Hartmut Glaser,
- Program Chairs:
- Ricardo Baeza-Yates,
- Sue Moon
Copyright © 2013 Copyright is held by the International World Wide Web Conference Committee (IW3C2).
Sponsors
- NICBR: Nucleo de Informatcao e Coordenacao do Ponto BR
- CGIBR: Comite Gestor da Internet no Brazil
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 13 May 2013
Check for updates
Author Tags
Qualifiers
- Abstract
Conference
WWW '13
Sponsor:
- NICBR
- CGIBR
Acceptance Rates
WWW '13 Companion Paper Acceptance Rate 831 of 1,250 submissions, 66%;
Overall Acceptance Rate 1,899 of 8,196 submissions, 23%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 174Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Other Metrics
Citations
Cited By
View all- Xia FAsabere NLiu HChen ZWang W(2017)Socially Aware Conference Participant Recommendation With Personality TraitsIEEE Systems Journal10.1109/JSYST.2014.234237511:4(2255-2266)Online publication date: Dec-2017
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in