Your browser doesn't support javascript.
loading
Movie Review Summarization Using Supervised Learning and Graph-Based Ranking Algorithm.
Khan, Atif; Gul, Muhammad Adnan; Zareei, Mahdi; Biswal, R R; Zeb, Asim; Naeem, Muhammad; Saeed, Yousaf; Salim, Naomie.
Afiliação
  • Khan A; Department of Computer Science, Islamia College University Peshawar, Peshawar 25000, KP, Pakistan.
  • Gul MA; Department of Computer Science, Islamia College University Peshawar, Peshawar 25000, KP, Pakistan.
  • Zareei M; Tecnologico de Monterrey, Escuela de Ingenieria y Ciencias, Zapopan, Jalisco 45138, Mexico.
  • Biswal RR; Tecnologico de Monterrey, Escuela de Ingenieria y Ciencias, Zapopan, Jalisco 45138, Mexico.
  • Zeb A; Department of Computer Science, Abbottabad University of Science and Technology, Abbottabad 25000, Pakistan.
  • Naeem M; Department of Computer Science, Abbottabad University of Science and Technology, Abbottabad 25000, Pakistan.
  • Saeed Y; Department of Information Technology, University of Haripur, Haripur, KP, Pakistan.
  • Salim N; School of Computing, Faculty of Engineering, Universiti Teknologi Malaysia, Johor Bahru, Malaysia.
Comput Intell Neurosci ; 2020: 7526580, 2020.
Article em En | MEDLINE | ID: mdl-32565772
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.
Assuntos

Texto completo: 1 Base de dados: MEDLINE Assunto principal: Algoritmos / Aprendizado de Máquina Supervisionado / Filmes Cinematográficos Tipo de estudo: Prognostic_studies Limite: Humans Idioma: En Ano de publicação: 2020 Tipo de documento: Article

Texto completo: 1 Base de dados: MEDLINE Assunto principal: Algoritmos / Aprendizado de Máquina Supervisionado / Filmes Cinematográficos Tipo de estudo: Prognostic_studies Limite: Humans Idioma: En Ano de publicação: 2020 Tipo de documento: Article