TY - JOUR
T1 - Automated rule selection for opinion target extraction
AU - Liu, Qian
AU - Gao, Zhiqiang
AU - Liu, Bing
AU - Zhang, Yuanlin
N1 - Funding Information:
Zhiqiang Gao’s research was supported by the 863 program grant 2015AA015406 and the NSF of China grant 61170165 . Bing Liu’s research was partially supported by the NSF grants IIS-1111092 and IIS-1407927, and a Google faculty award. Yuanlin Zhang’s work was partially supported by the NSF grant IIS-1018031. We would also like to thank Yun Lou and Pooja Sampelly for valuable discussions.
Publisher Copyright:
© 2016 Published by Elsevier B.V.
PY - 2016/7/15
Y1 - 2016/7/15
N2 - Opinion target extraction, also called aspect extraction, aims to extract fine-grained opinion targets from opinion texts, such as customer reviews of products and services. This task is important because opinions without targets are of limited use. It is one of the core tasks of the popular aspect-oriented opinion mining, and is also among the most challenging tasks tackled by opinion mining researchers. Previous work has shown that the syntactic-based approach, which employs extraction rules about grammar dependency relations between opinion words and aspects (or targets), performs quite well. This approach is highly desirable in practice because it is unsupervised and domain independent. The problem of this approach is that the extraction rules should be carefully selected and tuned manually so as not to produce too many errors. Although it is easy to evaluate the accuracy of each rule automatically, it is not easy to select a set of rules that produces the best overall result due to the overlapping coverage of the rules. In this paper, we propose two approaches to select an effective set of rules. The first approach employs a greedy algorithm, and the second one employs a local search algorithm, specifically, simulated annealing. Our experiment results show that the proposed approaches can select a subset of a given rule set to achieve significantly better results than the full rule set and the existing state-of-the-art CRF-based supervised method.
AB - Opinion target extraction, also called aspect extraction, aims to extract fine-grained opinion targets from opinion texts, such as customer reviews of products and services. This task is important because opinions without targets are of limited use. It is one of the core tasks of the popular aspect-oriented opinion mining, and is also among the most challenging tasks tackled by opinion mining researchers. Previous work has shown that the syntactic-based approach, which employs extraction rules about grammar dependency relations between opinion words and aspects (or targets), performs quite well. This approach is highly desirable in practice because it is unsupervised and domain independent. The problem of this approach is that the extraction rules should be carefully selected and tuned manually so as not to produce too many errors. Although it is easy to evaluate the accuracy of each rule automatically, it is not easy to select a set of rules that produces the best overall result due to the overlapping coverage of the rules. In this paper, we propose two approaches to select an effective set of rules. The first approach employs a greedy algorithm, and the second one employs a local search algorithm, specifically, simulated annealing. Our experiment results show that the proposed approaches can select a subset of a given rule set to achieve significantly better results than the full rule set and the existing state-of-the-art CRF-based supervised method.
KW - Aspect extraction
KW - Greedy algorithm
KW - Opinion mining
KW - Rule selection
KW - Simulated annealing
UR - http://www.scopus.com/inward/record.url?scp=84992298472&partnerID=8YFLogxK
U2 - 10.1016/j.knosys.2016.04.010
DO - 10.1016/j.knosys.2016.04.010
M3 - Article
AN - SCOPUS:84992298472
SN - 0950-7051
VL - 104
SP - 74
EP - 88
JO - Knowledge-Based Systems
JF - Knowledge-Based Systems
ER -