The K-means algorithm is one of the most often used clustering techniques. However, when it comes to discovering clusters in informetric data sets that consist of non-increasingly ordered vectors of not necessarily conforming lengths, such a method cannot be applied directly. Hence, in this paper, we propose a K-means-like algorithm to determine groups of producers that are similar not only wit...

In this paper, we propose a new clustering algorithm to cluster data. The proposed algorithm adopts a new non-metric measure based on the idea of “symmetry”. The detected clusters may be a set of clusters of different geometrical structures. Three data sets are tested to illustrate the effectiveness of our proposed algorithm.

Uniform deviation bounds limit the difference between a model’s expected loss and its loss on a random sample uniformly for all models in a learning problem. In this paper, we provide a novel framework to obtain uniform deviation bounds for unbounded loss functions. As a result, we obtain competitive uniform deviation bounds for k-Means clustering under weak assumptions on the underlying distri...

The K-Means clustering is by far the most widely used method for discovering clusters in data. It has a good performance on the data with compact super-sphere distributions, but tends to fail in the data organized in more complex and unknown shapes. In this paper, we analyze in detail the characteristic property of data clustering and propose a novel dissimilarity measure, named density-sensiti...

Clustering is a separation of data into groups of similar objects. Every group called cluster consists of objects that are similar to one another and dissimilar to objects of other groups. In this paper, the K-Means algorithm is implemented by three distance functions and to identify the optimal distance function for clustering methods. The proposed K-Means algorithm is compared with K-Means, S...

Clustering in data mining is very important to discover distribution patterns and this importance tends to increase as the amount of data grows. It is one of the main analytical methods in data mining and its method influences its results directly. K-means is a typical clustering algorithm[3]. It mainly consists of two phases i.e. initializing random clusters and to find the nearest neighbour. ...

We propose a method of using clustering techniques to partition a set of orders. We define the term order as a sequence of objects that are sorted according to some property, such as size, preference, or price. These orders are useful for, say, carrying out a sensory survey. We propose a method called the ko’means method, which is a modified version of a k-means method, adjusted to handle order...

This paper presents a research on clustering an image collection using multi-visual features. The proposed method extracted a set of visual features from each image and performed multi-dimensional K-Means clustering on the whole collection. Furthermore, this work experiments on different number of visual features combination for clustering. 2, 3, 5 and 7 pair of visual features chosen from a to...

A novel method of performing multiscale segmentation of radar reflectivity data using statistical properties within the radar data itself is introduced. The method utilizes a K-Means clustering of texture vectors computed within the