social network based opinion processing for optimal recommender engine
K.S.Sakunthala Prabha,K.DuraiRaj
Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology
ISSN: 2321-3337 Impact Factor:1.521 Volume:3 Issue:3 Year: 12 November,2014 Pages:375-387
Abstract
In the latest trend of internet, optimized suggestions for the search are anticipated by every individual. Crowd sourcing, a largest human resource provider network useful in search suggestions that helps to find out common phrases that other people have searched for. We identify an interesting real time problem, finding the best products through suggestions with individual user rating to a particular brand as well as with the rating of the friends to the product and the generalized crowd sourcing opinion. The system comprise of product to product co-relation under a brand, user to user co-relation under common attributes, crowd sourcing opinion by means of key factors obtained for the product in order make the suggestions more optimal.
Kewords
ECONOMICAL FEASIBILITY,TECHNICAL FEASIBILITY,SOCIAL FEASIBILITY
Reference
[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 ofnetnews,” 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://foursquare.com SARWAT ET AL.: LARS*: AN EFFICIENT AND SCALABLE LOCATION-AWARE RECOMMENDER SYSTEM 1399 [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 collaborativefiltering 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 neighbour queries over sliding windows,” IEEE Trans. Knowl. Data Eng., vol. 19, no. 6, pp. 789–803, Jun. 2007
