Computing Group News Documents Using K-Means and K-Nearest Neighbor

The aim of the study was to reduce the computational time of the document search by using the K-Means and K-Nearest Neighbor algorithm. The search result through search engines with display the documents according to the keywords entered. The number of documents that were displayed will make the user difficult to fine the required documents and it a long time for the display process of the documents. K-Means algorithm is used for the clustering documents obtained through online with search engine whereas algorithm K-Nearst Neighbor is used for grouping the clustering result document that are done with offline. The clustering with K-Means can reduce computational time on the news grouping by using K-Nearst Neighbor. The combination of two methods result an average time of 0.5011 seconds. Whereas the grouping that uses pure K-Nearst Neighbor requires the computational time 2.4841 seconds. The test result indicated that the combination of the two algorithms resulted accurate classification with the faster computation time.