Many algorithms are available to learn deep hierarchies of features from unlabeled data, especially images. In many cases, these algorithms involve multi-layered networks of features (e.g., neural networks) that are sometimes tricky to train and tune and are difficult to scale up to many machines effectively. Recently, it has been found that K-means clustering can be used as a fast alternative ...

This paper presents work on developing a software system for predicting crop yield from climate and plantation data. At the core of this system is a method for unsupervised partitioning of data for finding spatio-temporal patterns in climate data using kernel methods which offer strength to deal with complex data. For this purpose, a robust weighted kernel k-means algorithm incorporating spatia...

We explore the use of extended pixel representation for color based image segmentation using the K-means clustering algorithm. Various extended pixel representations have been implemented in this paper and their results have been compared. By extending the representation of pixels an image is mapped to a higher dimensional space. Unlike other approaches, where data is mapped into an implicit fe...

Purpose – The purpose of this paper is to provide a clustering approach to segment supply chain partners in the automobile industry and prioritize services offered by third party logistics service (3PL) providers. Design/methodology/approach – In total, 98 automobile and auto-parts manufacturers are surveyed to identify service needs, preferences, and outsourcing commitments. By applying a two-...

We present the first linear time (1+ε)-approximation algorithm for the k-means problem for fixed k and ε. Our algorithm runs in O(nd) time, which is linear in the size of the input. Another feature of our algorithm is its simplicity – the only technique involved is random sampling.

Normalized Cuts is a state-of-the-art spectral method for clustering. By applying spectral techniques, the data becomes easier to cluster and then k-means is classically used. Unfortunately the number of clusters must be manually set and it is very sensitive to initialization. Moreover, k-means tends to split large clusters, to merge small clusters, and to favor convex-shaped clusters. In this ...

One of the main approaches for modeling fracture and crack propagation in solid materials is adaptive insertion of cohesive elements, in which line-like (2D) or surface-like (3D) elements are inserted into the finite element mesh to model the nucleation and propagation of failure surfaces. In this approach, however, cracks are forced to propagate along element boundaries, following paths that i...

We consider the stability of k-means clustering problems. Clustering stability is a common heuristics used to determine the number of clusters in a wide variety of clustering applications. We continue the theoretical analysis of clustering stability by establishing a complete characterization of clustering stability in terms of the number of optimal solutions to the clustering optimization prob...

This paper proposes a simple, automatic and efficient clustering algorithm, namely, Automatic Merging for Optimal Clusters (AMOC) which aims to generate nearly optimal clusters for the given datasets automatically. The AMOC is an extension to standard k-means with a two phase iterative procedure combining certain validation techniques in order to find optimal clusters with automation of merging...

India being an agro-based economy, farmers experince alot of problem in detecting andpreventing diseases in fauna. So there is a necessacity in detecting diseases in fauna which proves to be effective and conviennent for researchers. Relying on pure naked-eye observation to detect and classify diseases can be very unprecise and cumbersome. The color and texture features are used to recognize an...