MODIFIKASI FUNGSI DENSITY PADA ALGORITMA ANT CLUSTERING
DOI:
https://doi.org/10.33197/jitter.vol1.iss2.2015.55Abstrak
[INA]
Clustering merupakan salah satu tugas dalam data mining untuk mengelompokkan data berdasarkan kemiripan karakteristik. Pada penelitian ini, akan diusulkan sebuah modifikasi pada algoritma Ant Clustering untuk mempercepat proses komputasi. Modifikasi dilakukan pada fungsi density dengan mempertimbangkan batasan pemisahan spasial. Dari hasil percobaan yang dilakukan dengan data sejumlah 800 baris dan jumlah iterasi sebanyak 1000, didapatkan bahwa modifikasi fungsi density pada algoritma Ant Clustering berhasil meningkatkan kecepatan dengan nilai akurasi yang tidak terlalu berbeda dengan algoritma Ant Clustering standar.
[EN]
Clustering is one of the tasks in data mining to group data based on similar characteristics. In this study, will be proposed a modification on Ant Clustering algorithm to speed up the process of computing. Modifications carried on by considering the density function limits the spatial separation. From the results of experiments conducted with a number of data lines 800 and the number of iterations of 1000, it was found that the density modification function on Ant Clustering algorithms managed to increase the speed with accuracy values that are not too different from Ant Clustering algorithm standard.
Unduhan
Unduhan
Diterbitkan
Cara Mengutip
Terbitan
Bagian
Lisensi
Submission of a manuscript implies that the submitted work has not been published before (except as part of a thesis or report, or abstract); that it is not under consideration for publication elsewhere; that its publication has been approved by all co-authors. If and when the manuscript is accepted for publication, the author(s) still hold the copyright and retain publishing rights without restrictions. Authors or others are allowed to multiply the article as long as not for commercial purposes. For the new invention, authors are suggested to manage its patent before published. The license type is CC-BY-SA 4.0.
