Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Improving genomic classification via Pearson-based SNP selection: a comparison of k-NN, SVM, and random forest

Bulletin of Electrical Engineering and Informatics · Vol. 15 No. 1 (2026) · hlm. 568–584

DOI
10.11591/eei.v15i1.9087
ISSN
2089-3191, 2302-9285
Terbit
2026-02-01
Penerbit
Institute of Advanced Engineering and Science (IAES)
Bahasa
en
Lisensi
creativecommons.org/licenses/by-sa/4.0/

Abstrak

Accurate genomic classification is vital for precision health and population studies, yet high-dimensional single-nucleotide polymorphism (SNP) data (pn) amplify noise, redundancy, and overfitting. This study evaluates a simple, model-independent Pearson-based selection that ranks SNPs by feature–label correlation, and assesses k-nearest neighbors (k-NN), linear support vector machine (SVM), and random forest (RF) under leakage-free stratified Monte Carlo cross-validation (MCCV). Performance increases monotonically with |r|: the strongest tiers reach?99–100% accuracy; SVM leads in mid tiers (RF second), while k-NN is competitive mainly at the extremes. A matched-dimensionality PCA-120 baseline (TRAIN-only) attains parity for SVM/RF and trails slightly for k-NN at the 10% test size. With 120-SNP panels, prediction medians are?0.30 ms (SVM), 1.81–1.83 ms (k-NN), and 34–35 ms (RF), supporting CPU-only deployment. A consensus panel combining correlation evidence with principal component analysis (PCA) selection frequency yields interpretable Top-20/Top-120 subsets and |r|-based operating thresholds. Overall, Pearson-based selection provides a transparent, reproducible baseline for small-sample SNP classification, offering accuracy competitive with PCA at lower computational complexity and straightforward extensions to broader cohorts and multi-omics integration.

Kata kunci

Jaringan kolaborasi para penulis

18 penulis · 47 tautan kepenulisan bersama · 13 lintas organisasi

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

  • Satya Wacana Christian University
  • Universitas Raharja
  • Universitas Gadjah Mada
  • 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
Kristoko Dwi HartomoSatya Wacana Christian University5
Wiwin SulistyoSatya Wacana Christian University5
Bistok Hasiholan SimanjuntakSatya Wacana Christian University3
Bistok HasiholanSatya Wacana Christian University2
Untung RahardjaUniversitas Raharja1
Qurotul AiniUniversitas Raharja1
Nuke Puji Lestari SantosoUniversitas Raharja1
Danny ManonggaSatya Wacana Christian University1
Eko SediyonoSatya Wacana Christian University1
Rahmat Abadi SuharjoSatya Wacana Christian University1
Erwien ChristantoSatya Wacana Christian University1
Edi WinarkoUniversitas Gadjah Mada1
Mila Chrismawati PaselengSatya Wacana Christian University1
Dian Widiyanto ChandraSatya Wacana Christian University1
Yeremia Alfa SusatyoSatya Wacana Christian 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: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S2765016208, pertama di-harvest 19 Nov 2026, terakhir terlihat 19 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title xml:lang="en">Improving genomic classification via Pearson-based SNP selection: a comparison of k-NN, SVM, and random forest</dc:title><dc:creator>Prihanto Ngesti Basuki</dc:creator><dc:creator>Sri Yulianto Joko Prasetyo</dc:creator><dc:creator>Adi Setiawan</dc:creator><dc:subject>genomic classification</dc:subject><dc:subject>single nucleotide polymorphisms</dc:subject><dc:subject>Pearson correlation feature selection</dc:subject><dc:subject>SNP selection</dc:subject><dc:subject>k-nearest neighbors</dc:subject><dc:subject>support vector machine</dc:subject><dc:subject>random forest</dc:subject><dc:subject>small sample classification</dc:subject><dc:subject>computational efficiency</dc:subject><dc:subject>multi-omics integration</dc:subject><dc:description xml:lang="en">Accurate genomic classification is vital for precision health and population studies, yet high-dimensional single-nucleotide polymorphism (SNP) data (pn) amplify noise, redundancy, and overfitting. This study evaluates a simple, model-independent Pearson-based selection that ranks SNPs by feature–label correlation, and assesses k-nearest neighbors (k-NN), linear support vector machine (SVM), and random forest (RF) under leakage-free stratified Monte Carlo cross-validation (MCCV). Performance increases monotonically with |r|: the strongest tiers reach ?99–100% accuracy; SVM leads in mid tiers (RF second), while k-NN is competitive mainly at the extremes. A matched-dimensionality PCA-120 baseline (TRAIN-only) attains parity for SVM/RF and trails slightly for k-NN at the 10% test size. With 120-SNP panels, prediction medians are ?0.30 ms (SVM), 1.81–1.83 ms (k-NN), and 34–35 ms (RF), supporting CPU-only deployment. A consensus panel combining correlation evidence with principal component analysis (PCA) selection frequency yields interpretable Top-20/Top-120 subsets and |r|-based operating thresholds. Overall, Pearson-based selection provides a transparent, reproducible baseline for small-sample SNP classification, offering accuracy competitive with PCA at lower computational complexity and straightforward extensions to broader cohorts and multi-omics integration.</dc:description><dc:publisher>Institute of Advanced Engineering and Science (IAES)</dc:publisher><dc:date>2026-02-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:identifier>https://doi.org/10.11591/eei.v15i1.9087</dc:identifier><dc:identifier>10.11591/eei.v15i1.9087</dc:identifier><dc:source>Bulletin of Electrical Engineering and Informatics; Vol 15 No 1 (2026); 568-584</dc:source><dc:source>2089-3191</dc:source><dc:source>2302-9285</dc:source><dc:language>en</dc:language><dc:rights>https://creativecommons.org/licenses/by-sa/4.0/</dc:rights></oai_dc:dc>