19,897 research outputs found
Global Optimization strategies for two-mode clustering
Two-mode clustering is a relatively new form of clustering that clusters both rows and columns of a data matrix. To do so, a criterion similar to k-means is optimized. However, it is still unclear which optimization method should be used to perform two-mode clustering, as various methods may lead to non-global optima. This paper reviews and compares several optimization methods for two-mode clustering. Several known algorithms are discussed and a new, fuzzy algorithm is introduced. The meta-heuristics Multistart, Simulated Annealing, and Tabu Search are used in combination with these algorithms. The new, fuzzy algorithm is based on the fuzzy c-means algorithm of Bezdek (1981) and the Fuzzy Steps approach to avoid local minima of Heiser and Groenen (1997) and Groenen and Jajuga (2001). The performance of all methods is compared in a large simulation study. It is found that using a Multistart meta-heuristic in combination with a two-mode k-means algorithm or the fuzzy algorithm often gives the best results. Finally, an empirical data set is used to give a practical example of two-mode clustering.algorithms;fuzzy clustering;multistart;simulated annealing;simulation;tabu search;two-mode clustering
A GLOBAL ALGORITHM FOR THE FUZZY CLUSTERING PROBLEM
The Fuzzy clustering (FC) problem is a non-convex mathematical program which usually possesses several local minima. The global minimum solution of the problem is found using a simulated annealing-based algorithm. Some preliminary computational experiments are reported and the solution is compared with that generated by the Fuzzy C-means algorithm
Recommended from our members
The detection and classification of blast cell in Leukaemia Acute Promyelocytic Leukaemia (AML M3) blood using simulated annealing and neural networks
This paper was delivered at AIME 2011: 13th Conference on Artifical Intelligence in Medicine.This paper presents a method for the detection and classification of blast cells in M3 with others sub-types using simulated annealing and neural networks. In this paper, we increased our test result from 10 images to 20 images. We performed Hill Climbing, Simulated Annealing and Genetic Algorithms for detecting the blast cells. As a result, simulated annealing is the “best” heuristic search for detecting the leukaemia cells. From the detection, we performed features extraction on the blast cells and we classifying based on M3 and other sub-types using neural networks. We received convincing result which has targeting around 97% in classifying of M3 with other sub-types. Our results are based on real world image data from a Haematology Department.Universiti Sains Islam Malaysia and the Ministry of Higher Education, Malaysi
Computational Experience On Four Algorithms For The Hard Clustering Problem
In this paper, we consider the problem of clustering m objects in c clusters. The objects are represented by points in n-dimensional Euclidean space, and the objective is to classify these m points into c clusters such that the distance between points within a cluster and its center is minimized. The problem is a difficult optimization problem due to the fact that: it posseses many local minima. Several algorithms have been developed to solve this problem which include the k-means algorithm, the simulated annealing algorithm, the tabu search algorithm, and the genetic algorithm. In this paper, we study the four algorithms and compare their computational performance for the clustering problem. We test these algorithms on several clustering problems from the literature as well as several random problems and we report on our computational experience
- …