- journal@kawanad.com
- Banda Aceh City, Indonesia
- +6285277777449
About This Journal
Journal Innovations Computer Science is a peer-reviewed academic journal dedicated to publishing cutting-edge research and developments in the rapidly evolving field of computer science....
Learn MoreQuick Links
Recent Issues
Contact Info
- Banda Aceh, Indonesia
- +6285277777449
- journal@kawanad.com
- Week Days: 09.00 to 17.00
Sunday: Closed
Article
Optimasi Support Vector Mechine (SVM) Menggunakan K-Means dan K-Medoids untuk Klasterisasi Tema Tugas Akhir
- Authors Gaffy Patria
- Affiliations
- Published 2022-11-30
- Section Article
- DOI https://doi.org/10.56347/jics.v1i2.72
- Issue Vol. 1 No. 2 (2022): November 2022
Abstract
The large amount of final project document data from study programs at the Sekolah Tinggi Manajemen Informatika dan Komputer (STMIK) Abulyatama can make a major contribution to the difficulty of the process of grouping a student's final project theme. The clustering process that has been carried out manually so far has been very ineffective and inefficient, so a data mining application is needed to manage the data, especially for clustering the data. The goal to be achieved from writing this thesis is to implement the Support Vector Machine with K-Means and K-Medoids to optimize the final assignment clustering. the results of the Optimization Support Vector Machine (SVM) analysis using K-Means and K-Medoids for Grouping Student Final Project Themes can be concluded in a number of ways, namely; with the K-Means Clustering method it can be seen that there are 23 data mining, 10 networks, 26 artificial intelligence, and 21 websites, and website 11 items.
Keywords
Support Vector Machines; K-Means; K-Medoids; Final Project; Rapidminer
References
- Han, Jiawei dan Kamber, Micheline. (2016). Data Mining : Concept and. Techniques Second Edition. Morgan Kaufmann Publishers.
- Larose, Daniel T. (2015). Discovering Knowledge in Data : An Introduction to Data Mining. John Willey & Sons, Inc.
- Delen, D., & Crossland, M. D. (2008). Seeding the survey and analysis of research literature with text mining. Expert Systems with Applications, 34(3), 1707-1720. DOI: https://doi.org/10.1016/j.eswa.2007.01.035.
- Kontostathis, A., Galitsky, L. M., Pottenger, W. M., Roy, S., & Phelps, D. J. (2004). A survey of emerging trend detection in textual data mining. Survey of text mining, 185-224. DOI: https://doi.org/10.1007/978-1-4757-4305-0_9.
- Chakrabarti, S. (2000). Data mining for hypertext: A tutorial survey. ACM SIGKDD Explorations Newsletter, 1(2), 1-11. DOI: https://doi.org/10.1016/S0167-9236(99)00038-X.
- Ng, R. T., & Han, J. (2002). CLARANS: A method for clustering objects for spatial data mining. IEEE transactions on knowledge and data engineering, 14(5), 1003-1016. DOI: https://doi.org/10.1109/TKDE.2002.1033770.
- Zendrato, F. S. G., Triayudi, A., & Endah Tri, E. (2022). Analisis Clustering Dokumen Tugas Akhir Mahasiswa Sistem Informasi Universitas Nasional menggunakan Metode K-Means Clustering. Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi), 6(1), 70-76. DOI: https://doi.org/10.35870/jtik.v6i1.389.
- Salam, A., & Albahri, F. P. (2022). Sistem Rekomendasi Tugas Akhir Mahasiswa pada AMIK Indonesia untuk Mendukung Merdeka Belajar-Kampus Merdeka Menggunakan Metode Collaborative Filtering (CF). Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi), 6(2), 281-288. DOI: https://doi.org/10.35870/jtik.v6i2.420.
- Wali, M., & Safrizal, S. (2018). Similar text sebagai Pengkodean Aplikasi Plagiarisme. Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi), 2(1), 11-19. DOI: https://doi.org/10.35870/jtik.v2i1.43.
- Bakti, V. K., & Indriyatno, J. (2017). Klasterisasi Dokumen Tugas Akhir Menggunakan K-Means Clustering, Sebagai Analisa Penerapan Sistem Temu Kembali. KOPERTIP: Jurnal Ilmiah Manajemen Informatika dan Komputer, 1(1), 31-34. DOI: https://doi.org/10.32485/kopertip.v1i1.8.
- Ramdani, T., Chrisnanto, Y. H., & Maspupah, A. (2018, July). Pengklasifikasian Tema Penelitian Berdasarkan Abstrak Menggunakan Vector Space Model (VSM) dan K-Nearest Neighbor (K-NN). In Seminar Nasional Teknologi Informasi (Vol. 1, pp. 703-713).
- Sankoh, A. S., Musthafa, A. R., Rosadi, M. I., & Arifin, A. Z. (2015). Klasterisasi Jenis Musik Menggunakan Kombinasi Algoritma Neural Network, K-Means dan Particle Swarm Optimization. Jurnal Buana Informatika, 6(3). DOI: https://doi.org/10.24002/jbi.v6i3.431.
- Raharjo, S., & Winarko, E. (2014). Klasterisasi, klasifikasi dan peringkasan teks berbahasa indonesia. Prosiding KOMMIT.
- Nainggolan, R., & Lumbantoruan, G. (2018). Optimasi performa cluster K-Means menggunakan Sum of Squared Error (SSE). METHOMIKA: Jurnal Manajemen Informatika & Komputerisasi Akuntansi, 2(2), 103-108. DOI: https://doi.org/10.46880/jmika.Vol2No2.pp103-108.
- Ahmad, A., & Gata, W. (2022). Sentimen Analisis Masyarakat Indonesia di Twitter Terkait Metaverse dengan Algoritma Support Vector Machine. Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi), 6(4), 548-555. DOI: https://doi.org/10.35870/jtik.v6i4.569.
- Nanja, M. (2022). indonesia Clustering Daerah Penyebaran Covid-19 Di Indonesia Menggunakan Algoritma K-Medoids. Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi), 6(4), 608-615. DOI: https://doi.org/10.35870/jtik.v6i4.608.
- Triyanto, W. A. (2015). Algoritma K-Medoids Untuk Penentuan Strategi Pemasaran Produk. Simetris: Jurnal Teknik Mesin, Elektro dan Ilmu Komputer, 6(1), 183-188. DOI: https://doi.org/10.24176/simet.v6i1.254.
- Andini, A. D., & Arifin, T. (2020). Implementasi algoritma k-medoids untuk klasterisasi data penyakit pasien di rsud kota bandung. Jurnal Responsif: Riset Sains dan Informatika, 2(2), 128-138. DOI: https://doi.org/10.51977/jti.v2i2.247.
Author Biographies
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Articles in this journal are published under the Creative Commons Attribution Licence (CC-BY 4.0). This means that users may share and adapt the articles published on this website in a reasonable manner, but they must give appropriate credit to the creator and indicate the changes they have made. Users must not apply additional restrictions, but must publish the work under the same license (CC-BY 4.0).
Similar Articles
Discover other articles with topics similar to what you're currently reading. Find more references and expand your knowledge base.
Most read articles by the same author(s)
Related Articles
Subscribe to Our Journal Updates
