LARS*: An Efficient and Scalable Location-Aware Recommender System | IEEE Journals & Magazine | IEEE Xplore

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


Abstract:

This paper proposes LARS*, a location-aware recommender system that uses location-based ratings to produce recommendations. Traditional recommender systems do not conside...Show More

Abstract:

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.
Published in: IEEE Transactions on Knowledge and Data Engineering ( Volume: 26, Issue: 6, June 2014)
Page(s): 1384 - 1399
Date of Publication: 01 February 2013

ISSN Information:

References is not available for this document.

1 Introduction

Recommender systems make use of community opinions to help users identify useful items from a considerably large search space (e.g., Amazon inventory [1], Netflix movies). The technique used by many of these systems is collaborative filtering (CF) [2], which analyzes past community opinions to find correlations of similar users and items to suggest personalized items (e.g., movies) to a querying user . Community opinions are expressed through explicit ratings represented by the triple (user, rating, item) that represents a user providing a numeric rating for an item.

Netflix: http://www.netflix.com.

Select All
1.
G. Linden, B. Smith, and J. York, “Amazon.com recommendations: Item-to-item collaborative filtering,” IEEE Internet Comput., vol. 7, no. 1, pp. 76–80, Jan./Feb. 2003.
2.
P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl, “GroupLens: An open architecture for collaborative filtering of netnews,” in Proc. CSWC, Chapel Hill, NC, USA, 1994.
3.
The facebook blog. Facebook Places [Online]. Available: http://tinyurl.com/3aetfs3
4.
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. Knowl. Data Eng., vol. 17, no. 6, pp. 734–749, Jun. 2005.
5.
MovieLens [Online]. Available: http://www.movielens.org/
6.
Foursquare [Online]. Available: http://www.movielens.org/
7.
New York Times-A Peek into Netflix Queues [Online]. Available: http://www.nytimes.com/interactive/2010/01/10/nyregion/20100110-netflix-map.html
8.
J. J. Levandoski, M. Sarwat, A. Eldawy, and M. F. Mokbel, “LARS: A location-aware recommender system,” in Proc. ICDE, Washington, DC, USA, 2012.
9.
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, “Item-based collaborative filtering recommendation algorithms,” in Proc. Int. Conf. WWW, Hong Kong, China, 2001.
10.
J. S. Breese, D. Heckerman, and C. Kadie, “Empirical analysis of predictive algorithms for collaborative filtering,” in Proc. Conf. UAI, San Francisco, CA, USA, 1998.
11.
W. G. Aref and H. Samet, “Efficient processing of window queries in the pyramid data structure,” in Proc. ACM Symp. PODS, New York, NY, USA, 1990.
12.
R. A. Finkel and J. L. Bentley, “Quad trees: A data structure for retrieval on composite keys,” Acta Inf., vol. 4, no. 1, pp. 1–9, 1974.
13.
A. Guttman, “R-trees: A dynamic index structure for spatial searching,” in Proc. SIGMOD, New York, NY, USA, 1984.
14.
K. Mouratidis, S. Bakiras, and D. Papadias, “Continuous monitoring of spatial queries in wireless broadcast environments,” IEEE Trans. Mobile Comput., vol. 8, no. 10, pp. 1297–1311, Oct. 2009.
15.
K. Mouratidis and D. Papadias, “Continuous nearest neighbor queries over sliding windows,” IEEE Trans. Knowl. Data Eng., vol. 19, no. 6, pp. 789–803, Jun. 2007.
16.
M. F. Mokbel, X. Xiong, and W. G. Aref, “SINA: Scalable incremental processing of continuous queries in spatiotemporal databases,” in Proc. SIGMOD, Paris, France, 2004.
17.
J. L. Herlocker, J. A. Konstan, L. G. Terveen, and J. T. Riedl, “Evaluating collaborative filtering recommender systems,” ACM TOIS, vol. 22, no. 1, pp. 5–53, 2004.
18.
M. J. Carey and D. Kossmann, “On saying ”Enough Already!” in SQL,” in Proc. SIGMOD, New York, NY, USA, 1997.
19.
S. Chaudhuri and L. Gravano, “Evaluating top-k selection queries,” in Proc. Int. Conf. VLDB, Edinburgh, U.K., 1999.
20.
R. Fagin, A. Lotem, and M. Naor, “Optimal aggregation algorithms for middleware,” in Proc. ACM Symp. PODS, New York, NY, USA, 2001.
21.
J. Bao, C.-Y. Chow, M. F. Mokbel, and W.-S. Ku, “Efficient evaluation of k-range nearest neighbor queries in road networks,” in Proc. Int. Conf. MDM, Kansas City, MO, USA, 2010.
22.
G. R. Hjaltason and H. Samet, “Distance browsing in spatial databases,” ACM TODS, vol. 24, no. 2, pp. 265–318, 1999.
23.
K. Mouratidis, M. L. Yiu, D. Papadias, and N. Mamoulis, “Continuous nearest neighbor monitoring in road networks,” in Proc. Int. Conf. VLDB, Seoul, Korea, 2006.
24.
D. Papadias, Y. Tao, K. Mouratidis, and C. K. Hui, “Aggregate nearest neighbor queries in spatial databases,” ACM TODS, vol. 30, no. 2, pp. 529–576, 2005.
25.
S. Börzsönyi, D. Kossmann, and K. Stocker, “The skyline operator,” in Proc. ICDE, Heidelberg, Germany, 2001.
26.
M. Sharifzadeh and C. Shahabi, “The spatial skyline queries,” in Proc. Int. Conf. VLDB, Seoul, Korea, 2006.
27.
N. Bruno, L. Gravano, and A. Marian, “Evaluating top-k queries over web-accessible databases,” in Proc. ICDE, San Jose, CA, USA, 2002.
28.
P. Venetis, H. Gonzalez, C. S. Jensen, and A. Y. Halevy, “Hyper-local, directions-based ranking of places,” PVLDB, vol. 4, no. 5, pp. 290–301, 2011.
29.
M.-H. Park, J.-H. Hong, and S.-B. Cho, “Location-based recommendation system using Bayesian use,s preference model in mobile devices,” in Proc. Int. Conf. UIC, Hong Kong, China, 2007.
30.
Netflix News and Info—Local Favorites [Online]. Available: http://tinyurl.com/4qt8ujo

Contact IEEE to Subscribe

References

References is not available for this document.