Hybrid Imperialist Competitive Algorithm and Dynamic Validity Index to find the best clusters

سال انتشار: 1390
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 1,873

فایل این مقاله در 9 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

SASTECH05_180

تاریخ نمایه سازی: 22 مرداد 1391

چکیده مقاله:

Cluster analysis is one of attractive data mining technique that use in many fields. One of the popular types of clustering algorithms is the center based clustering algorithm. K-means used as a popular clustering method due to its simplicity and high speed in clustering large datasets. However, K-means has two shortcomings. K-means is dependent on the initial state and convergence to local optima in some of the large problems. In order to these shortcomings, in an unsupervised clustering the number of clusters needs to be fixed by a human analyst too. In order to overcome local optima problem and for determining the number of clusters, lots of studies done in clustering. In this paper we combine a new search heuristic called Imperialist Competitive Algorithm with Dynamic Validity Index (DVIndex) to find the best clusters. In this algorithm, we assume each clustering solution as a country and use we use DVIndex as an efficient method to find number of clusters for calculating the clustering cost in each step. We compared proposed algorithm with other heuristics algorithm in clustering, such as traditional K-means, CSO, GKA and PSO-GA, by implementing them on several well-known datasets. Our findings show that the proposed algorithm works better than the others.

نویسندگان

Mojgan Ghanavati

Iran University of science and technology

Mohammad Reza Gholamian

Iran University of science and technology

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • Atashpaz Gargary, E., et al., 2008. Colonial competitive algorithm A ...
  • Atashp az-Gargari, E., Lucas, Caro., 2007. Imperialist Competitive Algorithm: An ...
  • B iab angard-O skouyi, E., et al., 2009. Application of ...
  • Du, Z., et al., 2008. PK-means: A new algorithm for ...
  • Hung, C.C., Wan, L., 2009. Hybridization of Particle Swarm Optimization ...
  • Kao, Y-T., et al., 2008. A hybridized approach to data ...
  • Nazari- Shirkouhi, S., et al., 2010. Solving the integrated product ...
  • Niknam, T., et al., 2009. An efficient hybrid evolutionary optimization ...
  • "sAsrech 201 1, Khavaran Higher-education Institute, Mashhad, Iran. May 12-14. ...
  • Niknam, T., et al., 2010. An efficient hybrid algorithm based ...
  • Nguyen, C.D., Cios, K.J., 2008. GAKREM: A novel hybrid clustering ...
  • Nopiah, Z.M., et al, 2009. A Weighted Genetic Algorithm Based ...
  • Rajabioun, R., Atashpas -Gargari, E., Lucas, C., 2008, Colonial Competitive ...
  • Zhang, C., Ouyang, D., Ning, J., 2010, An artificial bee ...
  • نمایش کامل مراجع