Artificial Intelligence

    

Modification of K Nearest Neighbor by Graph Similarity Metric for Keyword Extraction

Authors: Taeho Jo

This article proposes the modified KNN (K Nearest Neighbor) algorithm which receives a graph as its input data and is applied tothe keyword extraction. The graph is more graphical for representing a word and the keyword extraction is able to be mapped into thebinary classification where each word is classified into keyword or non-keyword. In the proposed system, a text which is given as theinput is indexed into a list of words, each word is classified by the proposed KNN version, and the words which are classified into keyword are extracted ad the output. The proposed KNN version is empirically validated as the better approach in deciding whether each word is a keyword or non-keyword in news articles and opinions.In this article, a word is encoded into a weighted and undirectedgraph and it is represented into a list of edges.

Comments: 11 Pages.

Download: PDF

Submission history

[v1] 2024-05-29 02:58:37

Unique-IP document downloads: 213 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus