CPSO: Chaotic Particle Swarm Optimization for Cluster Analysis

نویسندگان

چکیده

(Background) To solve the cluster analysis better, we propose a new method based on chaotic particle swarm optimization (CPSO) algorithm.
 (Methods) In order to enhance performance in clustering, novel CPSO. We first evaluate clustering of this model using Variance Ratio Criterion (VRC) as evaluation metric. The effectiveness CPSO algorithm is compared with that traditional Particle Swarm Optimization (PSO) algorithm. aims improve VRC value while avoiding local optimal solutions. simulated dataset set at three levels overlapping: non-overlapping, partial overlapping, and severe overlapping. Finally, compare two other methods.
 (Results) By observing comparative results, our proposed performs outstandingly. conditions has best variance ratio criterion values 1683.2, 620.5, 275.6, respectively. mean these cases are 617.8, 222.6.
 (Conclusion) performed better than SOTA methods for problems. effective analysis.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chaotic-based Particle Swarm Optimization with Inertia Weight for Optimization Tasks

Among variety of meta-heuristic population-based search algorithms, particle swarm optimization (PSO) with adaptive inertia weight (AIW) has been considered as a versatile optimization tool, which incorporates the experience of the whole swarm into the movement of particles. Although the exploitation ability of this algorithm is great, it cannot comprehensively explore the search space and may ...

متن کامل

Particle Swarm Optimization for Hydraulic Analysis of Water Distribution Systems

The analysis of flow in water-distribution networks with several pumps by the Content Model may be turned into a non-convex optimization uncertain problem with multiple solutions. Newton-based methods such as GGA are not able to capture a global optimum in these situations. On the other hand, evolutionary methods designed to use the population of individuals may find a global solution even for ...

متن کامل

Chaotic Rough Particle Swarm Optimization Algorithms

The problem of finding appropriate representations for various is a subject of continued research in the field of artificial intelligence and related fields. In some practical situations, mathematical and computational tools for faithfully modeling or representing systems with uncertainties, inaccuracies or variability in computation should be provided; and it is preferable to develop models th...

متن کامل

Empirically characteristic analysis of chaotic PID controlling particle swarm optimization

Since chaos systems generally have the intrinsic properties of sensitivity to initial conditions, topological mixing and density of periodic orbits, they may tactfully use the chaotic ergodic orbits to achieve the global optimum or their better approximation to given cost functions with high probability. During the past decade, they have increasingly received much attention from academic commun...

متن کامل

A Particle Swarm Optimization derivative applied to cluster analysis

Modern machine learning and data analysis hinge on sophisticated search techniques. In general, exploration in high-dimensional and multi-modal spaces is needed. Some algorithms that imitate certain natural principles, the so-called evolutionary algorithms, have been used in different aspects of Environmental Science and have found numerous applications in Environmental related problems. In thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of artificial intelligence and technology

سال: 2023

ISSN: ['2766-8649']

DOI: https://doi.org/10.37965/jait.2023.0166