Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 3

PENERAPAN DATA MINING DENGAN METODE K-NEAREST NEIGHBOR (KNN) UNTUK MENGELOMPOKKAN MINAT KONSUMEN ASURANSI (PT.JASARAHARJA PUTERA)

SemanTIK: Teknik Informasi · Vol. 5 No. 1 (2019) · pp. 97–104

DOI
10.55679/semantik.v5i1.6141
ISSN
2502-8928, 2460-1446
Published
2019-06-30
Publisher
Informatics Engineering Department of Halu Oleo University
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Insurance comes from the word insurance, which means insurance. Insurance is an agreement between the insured (customer) and the insurer (insurance company). Data Mining is a way of finding hidden information in a database and is part of the Knowledge Discovery in Databases (KDD) process to find useful information and patterns in data. K-Nearest Neighbor (KNN) is a method that uses supervised algorithms where the results of newly classified query instances are based on the majority of the label classes on KNN. The purpose of the KNN algorithm is to classify new objects based on attributes and training data. The KNN algorithm works based on the shortest distance from the query instance to training data to determine the KNN. One way to calculate the short distance or distance of a neighbor using the Euclidean distance method. Euclidean distance is often used to calculate distances. Euclidean distance functions to test the size that can be used as an interpretation of the proximity of the distance between two objects.Based on the results of the testing carried out this application is able to make predictions by looking at the smallest error value. In motor vehicle insurance the smallest average value is found at k = 4 at 0.103 and the highest accuracy value is at k = 2 by 42%, personal accident insurance the smallest average value is at k = 2 at 0.116 and the highest accuracy value is at k = 2 by 67%, and fire insurance the smallest average value is at k = 2 at 0.088 and the highest accuracy value is at k = 2 at 67%.Keywords—Data Mining, Insurance, K-Nearest Neighbor DOI: 10.5281/zenodo.3116132

Collaboration network of the authors

40 authors · 120 co-authorship links · showing the 40 most connected

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Universitas Halu Oleo
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Sutardi SutardiUniversitas Halu Oleo8
Ika Purwanti NingrumUniversitas Halu Oleo7
Adha Mashur SajiahUniversitas Halu Oleo5
Isnawaty IsnawatyUniversitas Halu Oleo5
Natalis RansiUniversitas Halu Oleo5
Jumadil NangiUniversitas Halu Oleo4
Isnawaty IsnawatyAffiliation unknown4
LM TajidunUniversitas Halu Oleo4
Rahmat RamadhanUniversitas Halu Oleo3
Subardin SubardinAffiliation unknown3
Muhammad Ishak JaelaniUniversitas Halu Oleo2
Try Sugiyarto SoeparyantoUniversitas Halu Oleo2
Muh YaminUniversitas Halu Oleo2
Hastuti HastutiAffiliation unknown2
Rizal Adi SaputraUniversitas Halu Oleo2
Nurul Hajra Hadijah HajraUniversitas Halu Oleo1
Aditya PutraUniversitas Halu Oleo1
StatiswatyUniversitas Halu Oleo1
Lirna Frischa Dwi PutriAffiliation unknown1
Raviq Gandhu LahadiAffiliation unknown1
Jayanti Yusmah SariUniversitas Halu Oleo1
Linda Purnama MuriUniversitas Halu Oleo1
Niarma NiarmaUniversitas Halu Oleo1
Wa Ode ErmaliantiUniversitas Halu Oleo1
Gusti Made Cahya WiarjayaAffiliation unknown1
Azkar KumalaAffiliation unknown1
La Ode ApriadiAffiliation unknown1
LM. Fid AksaraUniversitas Halu Oleo1
Tamsil TajsamAffiliation unknown1
Ardiyanti PutriAffiliation unknown1
Ramadhin ZaidUniversitas Halu Oleo1
Nur Imran RuslanAffiliation unknown1
Masna JumiyatiAffiliation unknown1
La Ode HasnuddinAffiliation unknown1
Holis HermansyahUniversitas Halu Oleo1
Apriadi BaharAffiliation unknown1
Laode Hasnuddin S SagalaAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://ojs.uho.ac.id/index.php/semantik/oai, first harvested 29 Okt 2026, last seen 1 Nov 2026.
Original metadata (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PENERAPAN DATA MINING DENGAN METODE  K-NEAREST NEIGHBOR (KNN) UNTUK MENGELOMPOKKAN MINAT KONSUMEN ASURANSI (PT.JASARAHARJA PUTERA)</dc:title>
	<dc:creator>Kadir, Wa Ode Nurhayah</dc:creator>
	<dc:creator>Pramono, Bambang</dc:creator>
	<dc:creator>Statiswaty, Statiswaty</dc:creator>
	<dc:subject xml:lang="en-US"></dc:subject>
	<dc:description xml:lang="en-US">Insurance comes from the word insurance, which means insurance. Insurance is an agreement between the insured (customer) and the insurer (insurance company). Data Mining is a way of finding hidden information in a database and is part of the Knowledge Discovery in Databases (KDD) process to find useful information and patterns in data. K-Nearest Neighbor (KNN) is a method that uses supervised algorithms where the results of newly classified query instances are based on the majority of the label classes on KNN. The purpose of the KNN algorithm is to classify new objects based on attributes and training data. The KNN algorithm works based on the shortest distance from the query instance to training data to determine the KNN. One way to calculate the short distance or distance of a neighbor using the Euclidean distance method. Euclidean distance is often used to calculate distances. Euclidean distance functions to test the size that can be used as an interpretation of the proximity of the distance between two objects.Based on the results of the testing carried out this application is able to make predictions by looking at the smallest error value. In motor vehicle insurance the smallest average value is found at k  =  4 at 0.103 and the highest accuracy value is at k  =  2 by 42%, personal accident insurance the smallest average value is at k  =  2 at 0.116 and the highest accuracy value is at k  =  2 by 67%, and fire insurance the smallest average value is at k  =  2 at 0.088 and the highest accuracy value is at k  =  2 at 67%.Keywords—Data Mining, Insurance, K-Nearest Neighbor DOI : 10.5281/zenodo.3116132</dc:description>
	<dc:publisher xml:lang="en-US">Informatics Engineering Department of Halu Oleo University</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2019-06-30</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs.uho.ac.id/index.php/semantik/article/view/6141</dc:identifier>
	<dc:identifier>10.55679/semantik.v5i1.6141</dc:identifier>
	<dc:source xml:lang="en-US">SemanTIK : Teknik Informasi; Vol 5, No 1 (2019): semanTIK; 97-104</dc:source>
	<dc:source>2502-8928</dc:source>
	<dc:source>2460-1446</dc:source>
	<dc:source>10.55679/semantik.v5i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs.uho.ac.id/index.php/semantik/article/view/6141/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 semanTIK</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>