원문정보
보안공학연구지원센터(IJHIT)
International Journal of Hybrid Information Technology
Vol.9 No.2
2016.02
pp.183-194
피인용수 : 0건 (자료제공 : 네이버학술정보)
목차
Abstract
1. Introduction
2. The Harmony Search Algorithm
2.1 Initialize the Problem and HS Parameters
2.2 Global-best Harmony Search
2.3 State-Feedback based harmony Search Algorithm
3. Fuzzy c-mean Clustering (FCM)
4. SFHS-based Clustering Algorithm
4.1 Preparation Work for using SFHS to FCM
4.2 Finding the Right Number of clusters
4.3 The Main Steps of SFHS-vased Clustering are as Follows:
5. Experiments and Discussion
5.1 Performance Measures
5.2 Finding the number of Clusters
6. Conclusion
References
1. Introduction
2. The Harmony Search Algorithm
2.1 Initialize the Problem and HS Parameters
2.2 Global-best Harmony Search
2.3 State-Feedback based harmony Search Algorithm
3. Fuzzy c-mean Clustering (FCM)
4. SFHS-based Clustering Algorithm
4.1 Preparation Work for using SFHS to FCM
4.2 Finding the Right Number of clusters
4.3 The Main Steps of SFHS-vased Clustering are as Follows:
5. Experiments and Discussion
5.1 Performance Measures
5.2 Finding the number of Clusters
6. Conclusion
References
저자정보
참고문헌
자료제공 : 네이버학술정보