Melola Discovery

← Melola Discovery

Jurnal

Comparison of Probabilistic Neural Network (PNN) and k-Nearest Neighbor (k-NN) Algorithms for Diabetes Classification

Recursive Journal of Informatics · Vol. 1 No. 2 (2023) · hlm. 73–82

DOI
10.15294/rji.v1i2.66078
ISSN
2986-6588, 2963-5551
Terbit
2023-09-29
Penerbit
Universitas Negeri Semarang
Bahasa
eng

Abstrak

Purpose: This study aims to compare algorithms to determine the accuracy of the algorithm and determine the speed of the algorithm used for diabetes classification. Methods: There are two algorithms used in this study, namely Probabilistic Neural Network (PNN) and k-Nearest Neighbor (k-NN). The data used is the Pima Indians Diabetes Database. The data contains 768 data with 8 attributes and 1 target class, namely 0 for no diabetes and 1 for diabetes. The dataset has been divided into 80% training data and 20% testing data. Result: Accuracy is obtained after implementing k-fold cross validation with a value of k = 4. The accuracy results show that the k-Nearest Neighbor algorithm is superior and has better quickness compared to the Probabilistic Neural Network. The k-Nearest Neighbor algorithm obtains an accuracy of 74.6% for all features and 78.1% for four features Novelty: The novelty of this paper is optimizing and improving accuracy which is implemented with by focusing on data preprocessing, feature selection and k-fold cross validation in the classification algorithm

Jaringan kolaborasi para penulis

9 penulis · 10 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • State University of Semarang
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Muhamad Faishol HakimState University of Semarang2
Meidika Bagus SaputroState University of Semarang2
Isa AkhlisState University of Semarang1
Septyana PutriState University of Semarang1
Dini ShalikhaState University of Semarang1
Sugiarto SugiartoState University of Semarang1
Atik SuryaniState University of Semarang1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://journal.unnes.ac.id/sju/index.php/rji/oai, pertama di-harvest 6 Nov 2026, terakhir terlihat 6 Nov 2026.
Metadata asli (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">Comparison of Probabilistic Neural Network (PNN) and k-Nearest Neighbor (k-NN) Algorithms for Diabetes Classification</dc:title>
	<dc:creator>Azzahrah, Diah Siti Fatimah</dc:creator>
	<dc:creator>Alamsyah, Alamsyah</dc:creator>
	<dc:description xml:lang="en-US">Purpose: This study aims to compare algorithms to determine the accuracy of the algorithm and determine the speed of the algorithm used for diabetes classification.
Methods: There are two algorithms used in this study, namely Probabilistic Neural Network (PNN) and k-Nearest Neighbor (k-NN). The data used is the Pima Indians Diabetes Database. The data contains 768 data with 8 attributes and 1 target class, namely 0 for no diabetes and 1 for diabetes. The dataset has been divided into 80% training data and 20% testing data.
Result: Accuracy is obtained after implementing k-fold cross validation with a value of k = 4. The accuracy results show that the k-Nearest Neighbor algorithm is superior and has better quickness compared to the Probabilistic Neural Network. The k-Nearest Neighbor algorithm obtains an accuracy of 74.6% for all features and 78.1% for four features
Novelty: The novelty of this paper is optimizing and improving accuracy which is implemented with by focusing on data preprocessing, feature selection and k-fold cross validation in the classification algorithm</dc:description>
	<dc:publisher xml:lang="en-US">Universitas Negeri Semarang</dc:publisher>
	<dc:date>2023-09-29</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unnes.ac.id/sju/rji/article/view/66078</dc:identifier>
	<dc:identifier>10.15294/rji.v1i2.66078</dc:identifier>
	<dc:source xml:lang="en-US">Recursive Journal of Informatics; Vol 1 No 2 (2023): September 2023; 73-82</dc:source>
	<dc:source>2986-6588</dc:source>
	<dc:source>2963-5551</dc:source>
	<dc:source>10.15294/rji.v1i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.unnes.ac.id/sju/rji/article/view/66078/25386</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2023 Recursive Journal of Informatics</dc:rights>
</oai_dc:dc>