Logo image
Simplified Swarm Optimization to Solve the K-Harmonic Means Problem for Mining Data
會議論文集

Simplified Swarm Optimization to Solve the K-Harmonic Means Problem for Mining Data

Wei-Chang Yeh 和 Chia-Ling Huang
Proceedings of the 18th Asia Pacific Symposium on Intelligent and Evolutionary Systems - Volume 2, 卷.2, 頁碼.429-439
01/01/2015
Web of Science ID: WOS:000380559600034

摘要

Computer Science Computer Science, Artificial Intelligence Computer Science, Theory & Methods Science & Technology Technology
This paper used an efficient hybrid data mining approach, called gSSO proposed by Yeh in 2014 [1], is a modification introduced to simplified swarm optimization and based on K-harmonic means (KHM) algorithm to help the KHM algorithm escape from local optimum. To test its solution quality, the proposed gSSO is compared with other recently introduced KHM-based Algorithms in a larger size dataset named car dataset in the UCI database. The experimental results conclude that the proposed gSSO outperforms other algorithms in the solution quality of all aspects including average, minimum, maximum, and standard deviation for space and stability.

相關連結

詳細資料

Logo image