Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
More reputable recommenders give more accurate recommendations?
Yuan W., Guan D., Han Y., Lee S., Lee Y.  ICUIMC 2013 (Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication, Kota Kinabalu, Malaysia, Jan 17-19, 2013)1-8.2013.Type:Proceedings
Date Reviewed: May 6 2013

Predictive analytics has hit the mainstream, thanks to the emergence of many day-to-day consumer applications such as Pandora, Netflix, Yelp, and Epinions, all of which contain some variation of a recommendation engine. These engines (or systems) recommend items about which the user is more likely to have a favorable opinion. A special class of recommendation systems is the one in which a user likes (trusts) a reviewer. These recommendation systems then use the network of trust to predict what items the user may like. Such systems attain reasonable rating predictions, albeit at a cost of high computational complexity.

In this paper, the authors seek to reduce the computational complexity of trust-aware recommendation systems (TARS). They hypothesize that we can perhaps reach a reasonable level of prediction accuracy by focusing on reputable recommenders alone. They define reputation by the distribution of the reviewer’s recommendations being liked or trusted. The authors conclude that while the hypothesis leads to a much more efficient algorithm, the accuracy of recommendations is compromised greatly, thereby requiring the summary rejection of the hypothesis. The results are supported by extensive experiments on Epinions datasets consisting of many thousands of users and almost half a million trust relations.

For research such as this, in which the authors try an alternative and report that the alternative method does not work, the value comes from our enriched understanding of the system model and the relationships between various components. Trust-aware recommendation systems are part of the family of recommendation systems that do not use the content of the item in the prediction. Rather, they use the similarity between the users and their mutual trust or liking factor to guide the ratings. That observation by itself can be interpreted in two contrasting ways: (1) a user who is trusted (directly or indirectly) by many others can generate more useful ratings, and (2) the reputation of a recommender plays no role for a user who does not like or trust the recommender. From this paper, it appears that the second interpretation is the more correct one, at least for the scenarios and datasets considered in this work. However, it may be interesting to consider the problem of the characterization of system models in which the trust “carries over,” and those in which it doesn’t.

Reviewer:  Amrinder Arora Review #: CR141205 (1308-0724)
Bookmark and Share
  Reviewer Selected
 
 
General (F.2.0 )
 
 
Intelligent Agents (I.2.11 ... )
 
 
Models (I.5.1 )
 
 
General (H.0 )
 
Would you recommend this review?
yes
no
Other reviews under "General": Date
Algorithms in C
Sedgewick R., Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990. Type: Book (9780201514254)
Sep 1 1991
Algorithms from P to NP (vol. 1)
Moret B., Shapiro H. (ed), Benjamin-Cummings Publ. Co., Inc., Redwood City, CA, 1991. Type: Book (9780805380088)
May 1 1992
The design and analysis of algorithms
Kozen D. (ed), Springer-Verlag New York, Inc., New York, NY, 1992. Type: Book (9780387976877)
Sep 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy