LARS*: An Efficient and Scalable Location-Aware Recommender System

被引:128
作者
Sarwat, Mohamed [1 ]
Levandoski, Justin J. [2 ]
Eldawy, Ahmed [1 ]
Mokbel, Mohamed F. [1 ]
机构
[1] Univ Minnesota, Dept Comp Sci & Engn, Minneapolis, MN 55455 USA
[2] Microsoft Corp, Redmond, WA 98052 USA
基金
美国国家科学基金会;
关键词
Recommender system; spatial; location; performance; efficiency; scalability; social; NEAREST-NEIGHBOR QUERIES;
D O I
10.1109/TKDE.2013.29
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes LARS*, a location-aware recommender system that uses location-based ratings to produce recommendations. Traditional recommender systems do not consider spatial properties of users nor items; LARS*, on the other hand, supports a taxonomy of three novel classes of location-based ratings, namely, spatial ratings for non-spatial items, non-spatial ratings for spatial items, and spatial ratings for spatial items. LARS* exploits user rating locations through user partitioning, a technique that influences recommendations with ratings spatially close to querying users in a manner that maximizes system scalability while not sacrificing recommendation quality. LARS* exploits item locations using travel penalty, a technique that favors recommendation candidates closer in travel distance to querying users in a way that avoids exhaustive access to all spatial items. LARS* can apply these techniques separately, or together, depending on the type of location-based rating available. Experimental evidence using large-scale real-world data from both the Foursquare location-based social network and the MovieLens movie recommendation system reveals that LARS* is efficient, scalable, and capable of producing recommendations twice as accurate compared to existing recommendation approaches.
引用
收藏
页码:1384 / 1399
页数:16
相关论文
共 28 条
[1]   Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions [J].
Adomavicius, G ;
Tuzhilin, A .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (06) :734-749
[2]  
Aref W. G., 1990, P ACM S PODS NEW YOR
[3]  
Bao J., 2010, P INT C MDM KANS CIT
[4]  
Borzsonyi S., 2001, P ICDE
[5]  
Breese J. S., 1998, P C UAI SAN FRANC CA
[6]  
BRUNO N, 2002, P ICDE
[7]  
Carey M. J., 1997, P SIGMOD
[8]  
Chaudhuri S., 1999, P INT C VLDB ED UK
[9]   Optimal aggregation algorithms for middleware [J].
Fagin, R ;
Lotem, A ;
Naor, M .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 66 (04) :614-656
[10]  
Finkel R. A., 1974, Acta Informatica, V4, P1, DOI 10.1007/BF00288933