z-logo
open-access-imgOpen Access
OPTIMASI ALGORITMA VECTOR SPACE MODEL DENGAN ALGORITMA K-NEAREST NEIGHBOUR PADA PENCARIAN JUDUL ARTIKEL JURNAL
Author(s) -
Siti Fauziah,
Daning Nur Sulistyowati,
Taufik Asra
Publication year - 2019
Publication title -
pilar nusa mandiri/pilar nusa mandiri
Language(s) - English
Resource type - Journals
eISSN - 2527-6514
pISSN - 1978-1946
DOI - 10.33480/pilar.v15i1.27
Subject(s) - computer science , point (geometry) , range (aeronautics) , space (punctuation) , information retrieval , mathematics , materials science , geometry , composite material , operating system
Articles is one part of the scientific work which was manifested in the form of writing and containing a lot of information that are requisite and suited therein to the exclusion of .Many small article day with allah is as a variety of sorts of the title and the methodology that was used , but does not make up for the possibility of a resemblance of the title of the article that is there is .This study aims to for determining the rate of a resemblance between an article of the american journal of public from the point of view of the title of the articles the american journal of public by the use of an algorithm of vector space the model and compare it with an algorithm k-nearest neghbour .The data used pt pgn promised to supply 10 the title of an article of the american journal of public keyword on information retrieval .Testing the data with of these keywords documents produced by the only by the magnitude of the resemblance of its on the highest a method of vsm it will be on a doc 5 , doc 7 , doc 8 and doc 4 .While for the program knn generate a level of the resemblance of its on range doc7 , doc10| doc8 , doc10| doc4 , d10| doc5 , doc10| doc3 , doc10. So that came to the conclusion that the occurrence of the addition of the criteria used to they obtain documents they do similaritas keyword after

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here