Aspect-Based Sentiment Analysis Using Tree Kernel Based Relation Extraction
Lecture notes in computer sciencePublished 1 January 2015
Thien Hai Nguyen, Kiyoaki Shirai
Citations17
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The authors' model can identify polarity of a given aspect based on the aspect-opinion relation extraction and outperformed the model without relation extraction by 5.8% on accuracy and 4.6% on F-measure.
Abstract
We present an application of kernel methods for extracting relation between an aspect of an entity and an opinion word from text. Two tree kernels based on the constituent tree and dependency tree were applied for aspect-opinion relation extraction. In addition, we developed a new kernel by combining these two tree kernels. We also proposed a new model for sentiment analysis on aspects. Our model can identify polarity of a given aspect based on the aspect-opinion relation extraction. It outperformed the model without relation extraction by 5.8% on accuracy and 4.6% on F-measure.
Keywords
Computer Science
Lecture notes in computer scienceText categorization with Support Vector Machines: Learning with many relevant features
7,925 Citations1998Thorsten Joachims
SVMs achieve substantial improvements over the currently best performing methods and behave robustly over a variety of di-erent learning tasks, eliminating the need for manual parameter tuning.
The Stanford CoreNLP Natural Language Processing Toolkit
7,238 Citations2014Christopher D. Manning, Mihai Surdeanu +4 more
The design and use of the Stanford CoreNLP toolkit is described, an extensible pipeline that provides core natural language analysis, and it is suggested that this follows from a simple, approachable design, straightforward interfaces, the inclusion of robust and good quality analysis components, and not requiring use of a large amount of associated baggage.
now publishers, Inc. eBooksOpinion Mining and Sentiment Analysis
6,745 Citations2008Bo Pang, Lillian Lee
Foundations and Trends® in Information RetrievalOpinion Mining and Sentiment Analysis
6,204 Citations2008Bo Pang, Lillian Lee
This survey covers techniques and approaches that promise to directly enable opinion-oriented information-seeking systems and focuses on methods that seek to address the new challenges raised by sentiment-aware applications, as compared to those that are already present in more traditional fact-based analysis.
SentiWordNet 3.0: An Enhanced Lexical Resource for Sentiment Analysis and Opinion Mining.
2,652 Citations2010Stefano Baccianella, Andrea Esuli +1 more
This work discusses SENTIWORDNET 3.0, a lexical resource explicitly devised for supporting sentiment classification and opinion mining applications, and reports on the improvements concerning aspect (b) that it embodies with respect to version 1.0.
A Survey of Opinion Mining and Sentiment Analysis
1,331 Citations2012Bing Liu, Lei Zhang
Sentiment analysis or opinion mining is the computational study of people’s opinions, appraisals, attitudes, and emotions toward entities, individuals, issues, events, topics and their attributes.
Joint sentiment/topic model for sentiment analysis
972 Citations2009Chenghua Lin, Yulan He
A novel probabilistic modeling framework based on Latent Dirichlet Allocation (LDA), called joint sentiment/topic model (JST), which detects sentiment and topic simultaneously from text is proposed, which is fully unsupervised.
A shortest path dependency kernel for relation extraction
971 Citations2005Răzvan Bunescu, Raymond J. Mooney
Experiments on extracting top-level relations from the ACE (Automated Content Extraction) newspaper corpus show that the new shortest path dependency kernel outperforms a recent approach based on dependency tree kernels.
Dependency tree kernels for relation extraction
825 Citations2004Aron Culotta, Jeffrey Sorensen
This work extends previous work on tree kernels to estimate the similarity between the dependency trees of sentences, and uses this kernel within a Support Vector Machine to detect and classify relations between entities in the Automatic Content Extraction (ACE) corpus of news articles.
Aspect and sentiment unification model for online review analysis
772 Citations2011Yohan Jo, Alice Oh
This paper proposes Sentence-LDA and extends it to Aspect and Sentiment Unification Model (ASUM), which incorporates aspect and sentiment together to model sentiments toward different aspects and shows that ASUM outperforms other generative models and comes close to supervised classification methods.
Technische Universität Dortmund Eldorado (Technische Universität Dortmund)Text categorization with support vector machines
507 Citations1997Thorsten Joachims
New ranking algorithms for parsing and tagging
505 Citations2001Michael Collins, Nigel Duffy
New learning algorithms for natural language processing based on the perceptron algorithm are introduced, showing how the algorithms can be efficiently applied to exponential sized representations of parse trees, such as the "all subtrees" (DOP) representation described by (Bod 1998).
Phrase dependency parsing for opinion mining
365 Citations2009Yuanbin Wu, Qi Zhang +2 more
A novel approach for mining opinions from product reviews is presented, where it converts opinion mining task to identify product features, expressions of opinions and relations between them by taking advantage of the observation that a lot of product features are phrases.
The MIT Press eBooksFast Kernels for String and Tree Matching
293 Citations2004S. V. N. Vishwanathan, Alexander J. Smola
A new algorithm suitable for matching discrete objects such as strings and trees in linear time is presented, thus obviating dynamic programming with quadratic time complexity and improvement on the currently available algorithms makes string kernels a viable alternative for the practitioner.
Empirical Methods in Natural Language ProcessingExtracting Aspect-Evaluation and Aspect-Of Relations in Opinion Mining
192 Citations2007Nozomi Kobayashi, Kentaro Inui +1 more
This work defines an opinion unit as a quadruple consisting of the opinion holder, the subject being evaluated, the part or the attribute in which the subject is evaluated, and the value of the evaluation that expresses a positive or negative assessment.
Convolution kernels on constituent, dependency and sequential structures for relation extraction
118 Citations2009Truc-Vien T. Nguyen, Alessandro Moschitti +1 more
This paper explores the use of innovative kernels based on syntactic and semantic structures for a target relation extraction task and illustrates that the combination of the above kernels achieves high effectiveness and significantly improves the current state-of-the-art.
Exploiting Coherence for the Simultaneous Discovery of Latent Facets and associated Sentiments
105 Citations2011Himabindu Lakkaraju, Chiranjib Bhattacharyya +2 more
This work is the first attempt to combine the notions of syntactic and semantic dependencies in the domain of review mining by jointly discovering latent facets and sentiment topics, and also order the sentiment topics with respect to a multi-point scale, in a language and domain independent manner.
Lecture notes in computer scienceDependency Tree Kernels for Relation Extraction from Natural Language Text
34 Citations2009Frank Reichartz, Hannes Korte +1 more
New tree kernels over dependency parse trees automatically generated from natural language text with richer structural features significantly outperform all published approaches for kernel-based relation extraction from dependency trees.
Lecture notes in computer scienceText Classification of Technical Papers Based on Text Segmentation
27 Citations2013Thien Hai Nguyen, Kiyoaki Shirai
A new model for text classification based on the structure of papers, called Back-off model, which achieves 60.45% Exact Match Ratio and 68.75% F-measure was proposed and it was shown that Back- off model outperformed two existing methods, ML-kNN and Binary Approach.