透過您的圖書館登入
IP:3.138.102.178
  • 學位論文

螢火蟲最佳化分群演算法

A Glowworm Algorithm for Solving Data Clustering Problems

指導教授 : 楊燕珠 高有成
若您是本文的作者,可授權文章由華藝線上圖書館中協助推廣。

摘要


本研究以螢火蟲最佳化(Glowworm Swarm Optimization, GSO)演算法為基礎,發展出新的資料分群方法,我們稱之為CGSO(Glowworm Swarm for Clustering)。GSO演算法是一種新的群體智慧技術,能夠求解連續型函數的最佳化問題,螢火蟲的亮度與解品質有關,其依賴亮度和半徑決定移動的方向,並會往較亮的螢火蟲移動,最終螢火蟲會聚集在多個位置上。本研究將資料分群問題設計為連續型最佳化問題並用GSO演算法求解。實驗結果顯示以GSO為基礎的分群演算法相較於K-Means和其他萬用啟發式演算法(Meta-Heuristic),如GA為基分群法、ACO為基分群法,能夠得到較佳的求解品值和穩定性,求解時間上也較ACO為基分群法SACO快速。

並列摘要


This paper presents a new data clustering algorithm based on glowworm swarm optimization (GSO) algorithm. GSO is a new type of swarm intelligence techniques and able to find solutions to optimization of continuous functions. In the proposed approach, data clustering problems are modeled as a continuous optimization problem and solved by using the GSO algorithm. The experimental results show that the GSO based clustering algorithm is very competitive compared to other meta-heuristic based approaches.

參考文獻


[17] 葉恆嘉,混合式螞蟻最佳分群演算法,大同大學資訊經營所,研究所碩士論文,2007。
[16] 丁淯淨,改良式螞蟻分群演算法,大同大學資訊經營所,研究所碩士論文, 2006。
[4] John , E. B. (1976). 'Synchronous Fireflies', Scientific American, May 1976. Vol.234, No. 5, pp. 74-85.
[6] Krishnanand, K. N., and Ghose, D. (2005). ‘Detection of multiple source locations using a glowworm metaphor with applications to collective robotics,’ Swarm Intelligence Symposium, 2005. SIS 2005. Proceedings 2005 IEEE , pp. 84-91, 8-10 June 2005
[7] Krishnanand, K. N., and Ghose, D. (2006). ‘Theoretical foundations for multiple rendezvous of glowworm-inspired mobile agents with variable local-decision domains,’ American Control Conference, 2006 , pp.6 , 14-16 June 2006

被引用紀錄


洪浩青(2009)。差分演算法實作軟體工作量預估之研究〔碩士論文,大同大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0081-0607200917250272

延伸閱讀