Penerapan Algoritma BM25 dalam Pencarian Lowongan Pekerjaan pada Website Job Portal
DOI:
https://doi.org/10.47065/bulletincsr.v5i5.760Keywords:
BM25; Algorithm; Job Search; Information Retrieval; Web-Based ApplicationAbstract
The development of the digital era has grown rapidly all the time which has significantly changed the job search process for job applicants, making Online Job Portals one of the main places in human resource recruitment activities, however, the effectiveness of Job Portals Job search still has fundamental weaknesses such as the job search technology used still uses simple string matching which can cause less relevant search results and reduce the quality of user experience in applying for jobs. This study was conducted to improve the quality of job vacancy search results on Job Portal A Career by applying the Okapi BM25 algorithm. This research method uses a Rapid Application Development (RAD) development approach, such as designing a client server architecture with Next.js as the frontend, ASP.NET Core as the backend and PostgreSQL as the main database. The BM25 algorithm is integrated directly into the database using the VectorChord BM25 extension to calculate the search relevance score with the user inputted query. In testing with the query “accelist the quality support career IT need”, the system displays 800 of 1,011 documents (79.13%) with a non-zero relevance score. Furthermore, evaluation through User Acceptance Testing (UAT) showed a user satisfaction rate of 91.2%, confirming that BM25 is capable of displaying the most relevant results at the top of the rankings and supporting the effectiveness of the search system. The results of this study can be concluded that the BM25 algorithm is a more effective and efficient search solution with high scalability potential for application to other web-based job search systems.
Downloads
References
O. Khatri and K. Muley, “Search Engine Optimization: An Overview,” Int. J. Adv. Res. Sci. Commun. Technol., vol. 2, no. 9, pp. 605–608, 2022, doi: 10.48175/ijarsct-5401.
K. A. Hambarde and H. Proenca, “Information Retrieval: Recent Advances and Beyond,” IEEE Access, vol. 11, no. January, pp. 76581–76604, 2023, doi: 10.1109/ACCESS.2023.3295776.
S. Susanti, M. Azmi, E. Ali, R. Rahmaddeni, and Y. Saputra Wijaya, “Perbandingan Boolean Model Dan Vector Space Model Dalam Pencarian Dokumen Teks,” Digit. Zo. J. Teknol. Inf. dan Komun., vol. 11, no. 2, pp. 268–277, 2020, doi: 10.31849/digitalzone.v11i2.4168.
C. I. Nakpih, “A modified Vector Space Model for semantic information retrieval,” Nat. Lang. Process. J., vol. 8, no. June, p. 100081, 2024, doi: 10.1016/j.nlp.2024.100081.
V. Meida Hersianty, E. Larasati Amalia, D. Puspitasari, and D. Wahyu Wibowo, “Penerapan Algoritma Tf-Idf Dan Cosine Similarity Dalam Sistem Rekomendasi Lowongan Pekerjaan,” JATI (Jurnal Mhs. Tek. Inform., vol. 9, no. 1, pp. 1619–1625, 2025, doi: 10.36040/jati.v9i1.12406.
P. P. Indah and Irwan, “Implementasi Metode Okapi BM 25 Dalam Aplikasi Pencarian Berita Polresta Pekanbaru Berbasis Android,” Mhs. Apl. Teknol. Komput. dan Inf., vol. 5, no. 1, pp. 26–31, 2023, doi: 10.35145/jmapteksi.v5i1.
Z. Zhang, “An Improved BM25 Algorithm for Clinical Decision Support in Precision Medicine Based on Co-Word Analysis and Cuckoo Search,” BMC Med. Inform. Decis. Mak., vol. 21, no. 1, pp. 1–16, 2021, doi: 10.1186/s12911-021-01454-5.
M. Widiasri, E. Tjandra, and L. M. Chandra, “Peningkatan Kinerja Pencarian Dokumen Tugas Akhir Menggunakan Porter Stemmer Bahasa Indonesia dan Fungsi Peringkat Okapi BM25,” Teknika, vol. 6, no. 1, pp. 54–60, 2017, doi: 10.34148/teknika.v6i1.65.
Q. Q. Abuein, M. Q. Shatnawi, and N. Alqudah, “Improving Job Matching with Deep Learning-Based Hyper-Personalization,” IAES Int. J. Artif. Intell., vol. 13, no. 2, pp. 1711–1722, 2024, doi: 10.11591/ijai.v13.i2.pp1711-1722.
A. Makris, K. Tserpes, G. Spiliopoulos, D. Zissis, and D. Anagnostopoulos, “Correction to: MongoDB Vs PostgreSQL: A Comparative Study on Performance Aspects (GeoInformatica, (2020), 10.1007/s10707-020-00407-w),” Geoinformatica, vol. 25, no. 1, pp. 241–242, 2021, doi: 10.1007/s10707-020-00424-9.
Harrison Oke Ekpobimi, “Building High-Performance Web Applications with NextJS,” Comput. Sci. IT Res. J., vol. 5, no. 8, pp. 1963–1977, 2024, doi: 10.51594/csitrj.v5i8.1459.
M. A. Othman and M. R. Girgis, “Solution- Architecture in ASP. Net Core,” Int. J. Comput. Appl., vol. 177, no. 42, pp. 15–24, 2020, doi: 10.5120/ijca2020919923.
Sapardi, W. H. Kristanto, and N. T. Kurniadi, “Implementasi Pengembangan Aplikasi Sistem Manajemen Aset Berbasis Web Menggunakan Metode Waterfall Untuk Mengoptimalkan Penggunaan Aset Pada PT. Hutama Karya (Persero),” J. Teknol. Dan Sist. Inf. Bisnis, vol. 5, no. 4, pp. 401–408, 2023, doi: 10.47233/jteksis.v5i4.948.
R. A. Satria, I. Indriati, and S. Sutrisno, “Pengelompokan Hasil Pencarian Skripsi Berbahasa Indonesia Menggunakan Metode DBSCAN dengan Pembobotan BM25,” J. Teknol. Inf. dan Ilmu Komput., vol. 10, no. 4, pp. 781–790, 2023, doi: 10.25126/jtiik.2024106899.
Lukman Santoso and Juni Amanullah, “Pengembangan Sistem Informasi Akademik Berbasis Website Menggunakan Metode Rapid Application Development (Rad),” Elkom J. Elektron. dan Komput., vol. 15, no. 2, pp. 250–259, 2022, doi: 10.51903/elkom.v15i2.943.
M. Fikri, I. M. Drehem, and A. R. Adriansyah, “Penerapan Micro Frontend dengan Next.js dan Module Federation pada Aplikasi Cash Management,” DBESTI J. Digit. Bus. Technol. Innov., vol. 2, no. 1, pp. 35–44, 2025, doi: 10.54914/dbesti.v2i1.1631.
A. Talekattu, R. Katiyar, and S. B., “Design of Web Applications in ASP.NET,” Int. J. Res. Appl. Sci. Eng. Technol., vol. 12, no. 6, pp. 536–541, 2024, doi: 10.22214/ijraset.2024.63128.
F. X. Senduk, X. B. N. Najoan, and S. R. U. A. Sompie, “Pengembangan Arsitektur Microservices dengan RESTful API Gateway menggunakan Backend-for-frontend Pattern pada Portal Akademik Perguruan Tinggi,” J. Tek. Inform., vol. 18, no. 1, pp. 315–324, 2023, doi: 10.35793/jti.v18i1.50402.
A. D. Praba and M. Safitri, “Studi Perbandingan Performansi Antara Mysql Dan Postgresql,” J. Khatulistiwa Inform., vol. 8, no. 2, pp. 88–93, 2020, doi: 10.31294/jki.v8i2.8851.
S. Safril, L. O. M. Golok Jaya, and J. Nangi, “Penerapan Metode Bm25 Pada Sistem Rekomendasi Dosen Pembimbing Dan Penguji Tugas Akhir Mahasiswa Berbasis Web,” semanTIK, vol. 7, no. 1, p. 51, 2021, doi: 10.55679/semantik.v7i1.12562.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Penerapan Algoritma BM25 dalam Pencarian Lowongan Pekerjaan pada Website Job Portal
ARTICLE HISTORY
How to Cite
Issue
Section
Copyright (c) 2025 Tek Kheng, Jefry Sunupurwa Asri, Sawali Wahyu, Yulhendri
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
