Beekeeping plays an important role in increasing and diversifying the incomes of many rural communities in Kingdom of Saudi Arabia. However, despite the region’s relatively good rainfall, which result in better forage conditions, bees and beekeepers are greatly affected by seasonal shortages of bee forage. Because of these shortages, beekeepers must continually move their colonies in search of ...

Learning the number of clusters is a key problem in data clustering. We present dip-means, a novel robust incremental method to learn the number of data clusters that can be used as a wrapper around any iterative clustering algorithm of k-means family. In contrast to many popular methods which make assumptions about the underlying cluster distributions, dip-means only assumes a fundamental clus...

Traditional clustering ensembles methods combine all obtained clustering results at hand. However, we observe that it can often achieve a better clustering solution if only part of all available clustering results are combined. This paper proposes a novel clustering ensembles method, termed as resampling-based selective clustering ensembles method. The proposed selective clustering ensembles me...

This paper shows that the k-means quantization of a signal can be interpreted both as a crisp indicator function and as a fuzzy membership assignment describing fuzzy clusters and fuzzy boundaries. Combined crisp and fuzzy indicator functions are defined here as natural generalizations of the ordinary crisp and fuzzy indicator functions, respectively. An application to iris segmentation is pres...

We propose a novel accelerated exact k-means algorithm, which performs better than the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3× faster. We also propose a general improvement of existing state-of-the-art accelerated exact k-means algorithms through better estimates of the distance bounds used to reduce the number of distance calculations, and g...

We present the global k-means algorithm which is an incremental approach to clustering that dynamically adds one cluster center at a time through a deterministic global search procedure consisting of N (with N being the size of the data set) executions of the k-means algorithm from suitable initial positions. We also propose modifications of the method to reduce the computational load without s...

Suppose k centers are fit to m points by heuristically minimizing the k-means cost; what is the corresponding fit over the source distribution? This question is resolved here for distributions with p ≥ 4 bounded moments; in particular, the difference between the sample cost and distribution cost decays with m and p as mmin{−1/4,−1/2+2/p}. The essential technical contribution is a mechanism to u...

Cardiac fibre architecture plays a key role in heart function. Recently, the estimation of fibre structure has been simplified with diffusion tensor MRI (DT-MRI). In order to assess the heart architecture and its underlying function, with the goal of dealing with pathological tissues and easing inter-patient comparisons, we propose a methodology for finding cardiac myofibrille trace corresponde...

Finding discords in time series database is an important problem in the last decade due to its variety of real-world applications, including data cleansing, fault diagnostics, and financial data analysis. The best known approach to our knowledge is HOT SAX technique based on the equiprobable distribution of SAX representations of time series. This characteristic, however, is not preserved in th...

Medoid clustering frequently gives better results than those of the K-means clustering in the sense that a unique object is the representative element of a cluster. Moreover the method of medoids can be applied to nonmetric cases such as weighted graphs that arise in analyzing SNS(Social Networking Service) networks. A general problem in clustering is that asymmetric measures of similarity or d...