In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated annealing (SA) based technique, in conjunction with four cluster validity indices, namely Davies-Bouldin index, Dunn’s index, Calinski-Harabasz index, and a recently developed index I . Based on a relation between the index I and the Dunn’s index, a lower bound of the value...

Optimal application performance on a Distributed Object Based System requires class fragmentation and the development of allocation schemes to place fragments at distributed sites so data transfer is minimal. In this paper we present a horizontal fragmentation approach that uses the k-means centroid based clustering method for partitioning object instances into fragments. Our new method takes f...

One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data records can e.g. be produced by the BIRCH algorithm. Typically they consist of the sufficient statistics of the form (N, X, X2) where N is the number of points, X is the (vector-)sum, and X2 is the square sum of the points. ...

in this research optimal reconfiguration strategy of the improved srr reconfigurable mobile robot based on force-angle stability measure has been designed using genetic algorithm. path tracking nonlinear controller which keeps robot’s maximum stability has been designed and simulated in matlab. motion equations of the robot have been derived in parametric form by means of newton- euler, lagrang...

(1) Johnny played a silly prank and had a lot of tasty licorice. phenomenon of perspectival plurality has been shown to pose a serious problem for at least some versions of relativism about predicates of taste (the view that postulates a parameter for perspectives in the circumstances of evaluation with respect to which utterances of sentences are evaluated). Perspectival plurality is the pheno...

DEVELOPMENTS IN CARDIAC surgery over the last 30 years have made consideration of surgical treatment part of the evaluation of most patients with heart disease. Naturally, surgery's most active proponents and innovators have been, in general, surgeons. Nonsurgeons frequently have been passively skeptical concerning these new forms of treatment, and occasionally have been actively resistant to t...

Clustering is a central problem in non-relational data analysis, with k-means being the most popular clustering technique. In various scenarios, it may be necessary to perform clustering over the same input data multiple times – with different values of k, different clustering attributes, or different initial centroids – before arriving at the final solution. In this paper, we propose algorithm...

In this paper, we present a new algorithm called, BiBinConvmean, for biclustering of binary microarray data. It is a novel alternative to extract biclusters from sparse binary datasets. Our algorithm is based on Iterative Row and Column Clustering Combination (IRCCC) and Divide and Conquer (DC) approaches, K-means initialization and the CroBin evaluation function [6]. Applied on binary syntheti...