RevRank: a Fully Unsupervised Algorithm for Selecting the Most Helpful Book Reviews
author:Oren Tsur,
School of Computer Science and Engineering, The Hebrew University of Jerusalem
published: June 24, 2009, recorded: May 2009, views: 102
published: June 24, 2009, recorded: May 2009, views: 102
You might be experiencing some problems with Your Video player.
Related content
Visitors who watched this lecture also watched...
01:02:31
210 views - Lillian Lee, 2009
01:11:36
102 views - Jon Kleinberg, 2009
24:21
706 views - Bing Liu, 2008
01:52:22
522 views - Jan Wiebe, 2008
24:37
18 views - Sean A. Munson, 2009
32:03
76 views - Ahmed Hassan, 2009
37:09
57 views - Jason Kessler, 2009
28:34
46 views - Dominique Cardon, 2009
28:04
56 views - Said Kashoob, 2009
54:36
330 views - Moungi G. Bawendi, 2008
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity:
You need to login to cast your vote.
Description
We present an algorithm for automatically ranking usergenerated book reviews according to review helpfulness. Given a collection of reviews, our REVRANK algorithm identifies a lexicon of dominant terms that constitutes the core of a virtual optimal review. This lexicon defines a feature vector representation. Reviews are then converted to this representation and ranked according to their distance from a ‘virtual core’ review vector. The algorithm is fully unsupervised and thus avoids costly and error-prone manual training annotations. Our experiments show that REVRANK clearly outperforms a baseline imitating the Amazon user vote review ranking system.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !




Write your own review or comment: