Validation of graph based K nearest neighbor for summarizing news articles

Abstract

This research proposes the text summarization tool based on a machine learning algorithm which is the modified KNN version which classifies a graph into summary or non-summary. The motivations of this research are the three facts: one fact is that a graph is a visualize representation of data items, another fact is that various similarity metrics among graphs are defined and the other is that the text summarization is able to be viewed into a classification task which a machine algorithm is applicable. The proposed system partitions a text into paragraphs, encode them into graphs in each of which vertices are words and edges are semantic relations between words, and applies the modified KNN version to the text summarization. The proposed approach is empirically validated as the better one, in summarizing news articles domain by domain. We need to consider the domain granularity and pre-classification of each full text into a domain for implementing the text summarization systems. © 2019 IEEE.