PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 1, 20052,168 citationsOpen Access

Seeing stars

BPBo PangLLLillian Lee

Key Points

Key points are not available for this paper at this time.

Abstract

We address the rating-inference problem, wherein rather than simply decide whether a review is "thumbs up" or "thumbs down", as in previous sentiment analysis work, one must determine an author's evaluation with respect to a multi-point scale (e.g., one to five "stars"). This task represents an interesting twist on standard multi-class text categorization because there are several different degrees of similarity between class labels; for example, "three stars" is intuitively closer to "four stars" than to "one star".We first evaluate human performance at the task. Then, we apply a meta-algorithm, based on a metric labeling formulation of the problem, that alters a given n-ary classifier's output in an explicit attempt to ensure that similar items receive similar labels. We show that the meta-algorithm can provide significant improvements over both multi-class and regression versions of SVMs when we employ a novel similarity measure appropriate to the problem.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Pang et al. (2005) studied this question.

synapsesocial.com/papers/6a0a543ba9576e6c7db4ecafhttps://doi.org/10.3115/1219840.1219855
Ask AI
Helpful
Bookmark
Share
View Full Paper