Solving Data Clustering Problems using Chaos Embedded Cat Swarm Optimization
Author(s):
Article Type:
Research/Original Article (بدون رتبه معتبر)
Abstract:
In this paper, a new method is proposed for solving the data clustering problem using Cat Swarm Optimization (CSO) algorithm based on chaotic behavior. The problem of data clustering is an important section in the field of the data mining, which has always been noted by researchers and experts in data mining for its numerous applications in solving real-world problems. The CSO algorithm is one of the latest meta-heuristic algorithms, which has a simple structure and it is easy to implement. The purpose of Chaos embedded Cat Swarm Optimization (CCSO) algorithm is to replace random values by chaotic ones to offer a stable algorithm that can allow for reaching the global optima to a large extent and improve the algorithm’s convergence speed. The proposed algorithm has been compared to other heuristic algorithms on standard data sets from UCI repository, and the experimental results demonstrate that the proposed algorithm yields high performance for solving the data clustering problem.Keywords: Data clustering, K-means, Cat Swarm Optimization, Chaos theory.
Keywords:
Language:
English
Published:
Journal of Advances in Computer Research, Volume:11 Issue: 2, Spring 2020
Pages:
1 to 15
magiran.com/p2207742
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 1,390,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
In order to view content subscription is required
Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!