Clustering is a method which divides data objects into groups based on the information found in data that describes the objects and relationships among them. There are a variety of algorithms have been developed in recent years for solving problems of data clustering. Data clustering algorithms can be either hierarchical or partitioned. Most promising among them are K-means algorithm which is p...

In this work, a hybrid Taguchi-Particle Swarm Optimization (TPSO) is proposed to solve global numerical optimization problems with continuous and discrete variables. This hybrid algorithm combines the well-known Particle Swarm Optimization Algorithm with the established Taguchi method, which has been an important tool for robust design. This paper presents the improvements obtained despite the ...

Graph coloring problem (GCP) is one of the most studied combinatorial optimization problems. It is important in theory and practice. There have been many algorithms for graph coloring problem, including exact algorithms and (meta-)heuristic algorithms. In this paper, we attempt another meta-heuristic method⎯particle swarm optimization to graph coloring problem. Particle swarm optimization (PSO)...

At the late evolution stage of the basic particle swarm optimization (BPSO), convergence process starts to slow down and the best fitness particle fluctuates around the globally-optimal solution, which may give rise to decrease on convergence precision of the BPSO. Therefore, an improved algorithm for particle swarm optimization was proposed. The modified version of PSO uses a controllable velo...

The need to deduce interesting and valuable information from large, complex, information-rich data sets is common to many research fields. Rule discovery or rule mining uses a set of IF-THEN rules to classify a class or category in a comprehensible way. Besides the classical approaches, many rule mining approaches use biologicallyinspired algorithms such as evolutionary algorithms and swarm int...