Search
Now showing items 1-9 of 9
Clustering Cells Shape Descriptors Using K-Means vs. Genetic Algorithm
(International Technology and Science Publications (UK), 2018)
This paper interested in clustering red blood cells, these cells are in form of digital images of blood films, a comparison made between Genetic Algorithm (GA) and K-Means behavior/performance in clustering. The data set ...
Clustering Algorithms in Echo State Networks
(2016)
In this work, we develop a new method of setting the input to reservoir and reservoir to reservoir weights in echo state machines. We use a clustering technique which we have previously developed as a pre-processing stage ...
Improving Bregman k-means
(Inderscience Publishers Ltd, 2014)
We review Bregman divergences and use them in clustering algorithms which we have previously developed to overcome one of the difficulties of the standard k-means algorithm which is its sensitivity to initial conditions ...
Visualising Data Using Reservoir with Clustering
(2013)
In this paper we illustrate a new method of visualizing and projecting time series data using reservoir computing with clustering algorithms. We show the advantages of using clustering with reservoir to visualize data. ...
Colour Based Segmentation of Red Blood Cells using K-means and Image Morphological Operations
(INTERNATIONAL JOURNAL OF ADVANCED AND INNOVATIVE RESEARCH, 2013)
This paper interested in clustering red blood cells, these cells are in form of digital images of blood films, a comparison made between Genetic Algorithm (GA) and K-Means behavior/performance in clustering. The data set ...
New Density-Based Clustering Technique: GMDBSCAN-UR.
(2012)
Density Based Spatial Clustering of Applications of Noise (DBSCAN) is one of the most popular algorithms for cluster analysis. It can discover clusters with arbitrary shape and separate noises. But this algorithm cannot ...
MULTI-DENSITY DBSCAN USING REPRESENTATIVES: MDBSCAN-UR.
(2011)
DBSCAN is one of the most popular algorithms for cluster analysis. It can discover clusters with arbitrary shape and separate noises. But this algorithm cannot choose its parameter according to distributing of dataset. It ...
An Initialization Method for the K-means Algorithm using RNN and Coupling Degree
(Foundation of Computer Science (FCS), 2011)
Since K-means is widely used for general clustering, its performance is a critical point. This performance depends highly on initial cluster centers since it may converge to numerous local minima. In this paper a proposed ...
Multi density DBSCAN
(Springer, Berlin, Heidelberg, 2011)
Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal ...