Melola Discovery

← Melola Discovery

Jurnal Tanpa peringkat SINTA

Comparison Model Optimal Machine Learning Model With Feature Extraction for Heart Attack Disease Classification

Scientific Journal of Informatics · Vol. 11 No. 2 (2024) · hlm. 485–492

DOI
10.15294/sji.v11i2.4561
ISSN
2407-7658, 2460-0040
Terbit
2024-05-31
Penerbit
Universitas Negeri Semarang
Bahasa
eng

Abstrak

Purpose: The purpose of this study is to classify the number of people affected by heart disease and those not affected by heart disease based on various categories of heart attack causes. This study aims to urge people to take better care of their health and to serve as a reference for doctors to educate patients about the dangers of heart attacks. Methods: The model will be constructed via a machine learning methodology. The algorithms utilized in its development encompass the Support Vector Machine (SVM) algorithm, the K-Nearest Neighbor (k-NN) algorithm, and the Random Forest (RF) algorithm. This study utilizes principal component analysis (PCA) as a means of extracting optimized features from the dataset, employing techniques for dimension reduction prior to modeling the data. Result: Cumulative explication of the concept of variance constitutes a foundational aspect of PCA (principal component analysis) within the scope of the current research, namely a dimensionality reduction technique employed in multivariate data analysis to facilitate model development, thereby enabling the creation of more optimal and comprehensive models. In this research, the dimensions of training data are incorporated during the process of model creation. The results show KNN model exhibits the highest performance, with an accuracy of 86%, precision of 86%, recall of 91%, and F1-score of 88%. Furthermore, evaluation using the ROC metric also provides a relatively favorable value, 0.85. Novelty: Researchers used 1190 patient data sourced from Kaggle. Before modeling the algorithm, researchers conducted EDA & Preprocessing which includes missing values to find data that does not have information, then duplicate data to find duplicated data, there are 270 duplicated data, then the duplicated data is deleted so that the data becomes 737, then PCA implementation is carried out. PCA is reducing features automatically without changing the data.

Kata kunci

Jaringan kolaborasi para penulis

9 penulis · 17 tautan kepenulisan bersama · 3 lintas organisasi

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

  • Universitas Buana Perjuangan Karawang
  • IPB University
  • 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
Nurul RomadoniUniversitas Buana Perjuangan Karawang2
Dwi Sulistya KusumaningrumUniversitas Buana Perjuangan Karawang2
Sony Hartono WijayaIPB University1
Yohanes Aris PurwantoIPB University1
Nahrowi NahrowiIPB University1

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/journals/sji/oai, pertama di-harvest 6 Nov 2026, terakhir terlihat 8 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">Comparison Model Optimal Machine Learning Model With Feature Extraction for Heart Attack Disease Classification</dc:title>
	<dc:creator xml:lang="en">Salsa Desmalia</dc:creator>
	<dc:creator xml:lang="en">Amril Mutoi Siregar</dc:creator>
	<dc:creator xml:lang="en">Kiki Ahmad Baihaqi</dc:creator>
	<dc:creator xml:lang="en">Tatang Rohana</dc:creator>
	<dc:subject xml:lang="en">Heart attack</dc:subject>
	<dc:subject xml:lang="en">Classification</dc:subject>
	<dc:subject xml:lang="en">Machine learning</dc:subject>
	<dc:subject xml:lang="en">PCA</dc:subject>
	<dc:subject xml:lang="en">ROC curve</dc:subject>
	<dc:description xml:lang="en">Purpose: The purpose of this study is to classify the number of people affected by heart disease and those not affected by heart disease based on various categories of heart attack causes. This study aims to urge people to take better care of their health and to serve as a reference for doctors to educate patients about the dangers of heart attacks.
Methods: The model will be constructed via a machine learning methodology. The algorithms utilized in its development encompass the Support Vector Machine (SVM) algorithm, the K-Nearest Neighbor (k-NN) algorithm, and the Random Forest (RF) algorithm.  This study utilizes principal component analysis (PCA) as a means of extracting optimized features from the dataset, employing techniques for dimension reduction prior to modeling the data.
Result: Cumulative explication of the concept of variance constitutes a foundational aspect of PCA (principal component analysis) within the scope of the current research, namely a dimensionality reduction technique employed in multivariate data analysis to facilitate model development, thereby enabling the creation of more optimal and comprehensive models. In this research, the dimensions of training data are incorporated during the process of model creation.   The results show KNN model exhibits the highest performance, with an accuracy of 86%, precision of 86%, recall of 91%, and F1-score of 88%. Furthermore, evaluation using the ROC metric also provides a relatively favorable value, 0.85.
Novelty: Researchers used 1190 patient data sourced from Kaggle. Before modeling the algorithm, researchers conducted EDA &amp;amp; Preprocessing which includes missing values to find data that does not have information, then duplicate data to find duplicated data, there are 270 duplicated data, then the duplicated data is deleted so that the data becomes 737, then PCA implementation is carried out.  PCA is reducing features automatically without changing the data.</dc:description>
	<dc:publisher xml:lang="en">Universitas Negeri Semarang</dc:publisher>
	<dc:date>2024-05-31</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">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unnes.ac.id/journals/sji/article/view/4561</dc:identifier>
	<dc:identifier>10.15294/sji.v11i2.4561</dc:identifier>
	<dc:source xml:lang="en">Scientific Journal of Informatics; Vol. 11 No. 2: Regular Issue; 485-492</dc:source>
	<dc:source>2407-7658</dc:source>
	<dc:source>2460-0040</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.unnes.ac.id/journals/sji/article/view/4561/435</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2024 Scientific Journal of Informatics</dc:rights>
</oai_dc:dc>