2018
DOI: 10.3390/su10051425
|View full text |Cite
|
Sign up to set email alerts
|

An Extended HITS Algorithm on Bipartite Network for Features Extraction of Online Customer Reviews

Abstract: How to acquire useful information intelligently in the age of information explosion has become an important issue. In this context, sentiment analysis emerges with the growth of the need of information extraction. One of the most important tasks of sentiment analysis is feature extraction of entities in consumer reviews. This paper first constitutes a directed bipartite feature-sentiment relation network with a set of candidate features-sentiment pairs that is extracted by dependency syntax analysis from consu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
12
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
2
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 11 publications
(12 citation statements)
references
References 38 publications
0
12
0
Order By: Relevance
“…Lei et al (2010) calculate the importance of candidate feature words by building a bipartite graph between candidate feature words and emotional words and utilizing the hyperlink-induced topic search (HITS) algorithm of webpage ranking. Liu et al (2018) combine PMI and a weighted HITS algorithm to sort candidate feature words on this basis. Meanwhile, Yan et al (2015) build a network structure of "feature words emotional words" based on a dependency syntactic analysis, and then apply the PageRank algorithm for feature extraction.…”
Section: Feature Extractionmentioning
confidence: 99%
“…Lei et al (2010) calculate the importance of candidate feature words by building a bipartite graph between candidate feature words and emotional words and utilizing the hyperlink-induced topic search (HITS) algorithm of webpage ranking. Liu et al (2018) combine PMI and a weighted HITS algorithm to sort candidate feature words on this basis. Meanwhile, Yan et al (2015) build a network structure of "feature words emotional words" based on a dependency syntactic analysis, and then apply the PageRank algorithm for feature extraction.…”
Section: Feature Extractionmentioning
confidence: 99%
“…For example, Alrababah et al (2017) first identify explicit opinionated features using WordNet (Miller, 1995;Thelwall et al, 2010) and sentiment strength estimator SentiStrength, then remove irrelevant ones according to frequency and semantic knowledge. Liu et al (2018) first select candidate feature-sentiment pairs by dependency syntax analysis, then filter them using pointwise mutual information (PMI; Church and Hanks, 1990) with a weighted hyperlink-induced topic search (HITS) algorithm. After feature identification, sentiment estimation can be carried out with sentiment lexicons, like SentiStrength and SentiWordNet (Baccianella et al, 2010).…”
Section: Fine-grained Sentiment Analysismentioning
confidence: 99%
“…Such evaluations give support only to solutions which detect needs already addressed in products and therefore are not fit for the evaluation of NPD. Other studies compare their approaches to a list of gold standard needs generated by having annotators read through a subset of the UGC posts used in the analysis [5][6][7][8][9]. Although these studies have other uses (e.g.…”
Section: Introductionmentioning
confidence: 99%