当前位置: X-MOL 学术Comput. Intell. Neurosci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Movie Review Summarization Using Supervised Learning and Graph-Based Ranking Algorithm.
Computational Intelligence and Neuroscience ( IF 3.120 ) Pub Date : 2020-06-02 , DOI: 10.1155/2020/7526580
Atif Khan 1 , Muhammad Adnan Gul 1 , Mahdi Zareei 2 , R R Biswal 2 , Asim Zeb 3 , Muhammad Naeem 3 , Yousaf Saeed 4 , Naomie Salim 5
Affiliation  

With the growing information on web, online movie review is becoming a significant information resource for Internet users. However, online users post thousands of movie reviews on daily basis and it is hard for them to manually summarize the reviews. Movie review mining and summarization is one of the challenging tasks in natural language processing. Therefore, an automatic approach is desirable to summarize the lengthy movie reviews, and it will allow users to quickly recognize the positive and negative aspects of a movie. This study employs a feature extraction technique called bag of words (BoW) to extract features from movie reviews and represent the reviews as a vector space model or feature vector. The next phase uses Naïve Bayes machine learning algorithm to classify the movie reviews (represented as feature vector) into positive and negative. Next, an undirected weighted graph is constructed from the pairwise semantic similarities between classified review sentences in such a way that the graph nodes represent review sentences, while the edges of graph indicate semantic similarity weight. The weighted graph-based ranking algorithm (WGRA) is applied to compute the rank score for each review sentence in the graph. Finally, the top ranked sentences (graph nodes) are chosen based on highest rank scores to produce the extractive summary. Experimental results reveal that the proposed approach is superior to other state-of-the-art approaches.

中文翻译:

使用监督学习和基于图的排名算法的电影评论摘要。

随着网络信息的增长,在线电影评论正成为互联网用户的重要信息资源。但是,在线用户每天都会发布数千条电影评论,因此他们很难手动汇总评论。电影评论的挖掘和总结是自然语言处理中的挑战性任务之一。因此,需要一种自动的方法来总结冗长的电影评论,并且它将允许用户快速识别电影的正面和负面方面。这项研究采用称为词袋(BoW)的特征提取技术从电影评论中提取特征,并将评论表示为向量空间模型或特征向量。下一阶段使用朴素贝叶斯机器学习算法将电影评论(表示为特征向量)分为正面和负面。接下来,从分类评论句子之间的成对语义相似性构造无向加权图,使得图节点代表评论句子,而图的边缘指示语义相似性权重。基于加权图的排名算法(WGRA)用于计算图中每个复审语句的排名得分。最后,根据最高等级分数选择排名最高的句子(图形节点)以产生摘要。实验结果表明,提出的方法优于其他最新技术。从分类评论句子之间的成对语义相似性构造无向加权图,使得图节点代表评论句子,而图的边缘指示语义相似度权重。基于加权图的排名算法(WGRA)用于计算图中每个复审语句的排名得分。最后,根据最高等级分数选择排名最高的句子(图形节点)以产生摘要。实验结果表明,提出的方法优于其他最新技术。由分类评论句子之间的成对语义相似性构造无向加权图,使得图节点代表评论句子,而图的边缘指示语义相似度权重。基于加权图的排名算法(WGRA)用于计算图中每个复审语句的排名得分。最后,根据最高等级分数选择排名最高的句子(图形节点)以产生摘要。实验结果表明,提出的方法优于其他最新技术。基于加权图的排名算法(WGRA)用于计算图中每个复审语句的排名得分。最后,根据最高等级分数选择排名最高的句子(图形节点)以产生摘要。实验结果表明,提出的方法优于其他最新技术。基于加权图的排名算法(WGRA)用于计算图中每个复审语句的排名得分。最后,根据最高等级分数选择排名最高的句子(图形节点)以产生摘要。实验结果表明,提出的方法优于其他最新技术。
更新日期:2020-06-02
down
wechat
bug