This paper presents a generalized version of the conventional k-means clustering algorithm [Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, University of California Press, Berkeley, 1967, p. 281]. Not only is this new one applicable to ellipse-shaped data clusters without dead-unit problem, but also performs correct clustering without pre-assigning the exact...

In this paper we present a new clustering method based on k-means that has been implemented on a video surveillance system. Rekmeans does not require to specify in advance the number of clusters to search for and is more precise than k-means in clustering data coming from multiple Gaussian distributions with different co-variances, while maintaining real-time performance. Experiments on real an...

background: breast cancer is currently one of the leading causes of death among women worldwide. the diagnosis and separation of cancerous tumors in mammographic images require accuracy, experience and time, and it has always posed itself as a major challenge to the radiologists and physicians. objective: this paper proposes a new algorithm which draws on discrete wavelet transform and adaptive...

Middle spatial resolution multi-spectral remote sensing image is a kind of color image with low contrast, fuzzy boundaries and informative features. In view of these features, the fuzzy C-means clustering algorithm is an ideal choice for image segmentation. However, fuzzy C-means clustering algorithm requires a pre-specified number of clusters and costs large computation time, which is easy to ...

We present a swarm intelligence approach to data clustering. Data is clustered without initial knowledge of the number of clusters. Ant based clustering is used to initially create raw clusters and then these clusters are refined using the Fuzzy C Means algorithm. Initially the ants move the individual objects to form heaps. The centroids of these heaps are taken as the initial cluster centers ...

This paper deals with multi-period project portfolio selection problem. In this problem, the available budget is invested on the best portfolio of projects in each period such that the net profit is maximized. We also consider more realistic assumptions to cover wider range of applications than those reported in previous studies. A novel mathematical model is presented to solve the problem, con...

Due to the progressive growth of the amount of data available in a wide variety of scientific fields, it has become more difficult to manipulate and analyze such information. In spite of its dependency on the initial settings and the large number of distance computations that it can require to converge, the K-means algorithm remains as one of the most popular clustering methods for massive data...

This paper proposed improved K-means clustering algorithm based on user tag. It first used social annotation data to expand the vector space model of K-means. Then, it applied the links involved in social tagging network to enhance the clustering performance. Experimental result shows that the proposed improved K-means clustering algorithm based on user tag is effective.

A new ensemble algorithm based on K-means clustering and probabilistic neural network called K-meansPNN for classifying the industrial system faults is presented. The proposed technique consists of a preprocessing unit based on K-means clustering and probabilistic neural network. Given a set of data points, firstly the K-means algorithm is used to obtain K-temporary clusters, and then PNN is us...