Results 1  10
of
1,805,685
An Improved Kmeans Clustering Algorithm
"... Abstract—An improved kmeans clustering algorithm based on KMEANS algorithm is proposed. This paper gives an improved traditional algorithm by analyzing the statistical data. After a comparison between the actual data and the simulation data, this paper safely shows that the improved algorithm sign ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract—An improved kmeans clustering algorithm based on KMEANS algorithm is proposed. This paper gives an improved traditional algorithm by analyzing the statistical data. After a comparison between the actual data and the simulation data, this paper safely shows that the improved algorithm
Effect of Distance Functions on KMeans Clustering Algorithm
"... Clustering analysis is the most significant step in data mining. This paper discusses the kmeans clustering algorithm and various distance functions used in kmeans clustering algorithm such as Euclidean distance function and Manhattan distance function. Experimental results are shown to observe th ..."
Abstract
 Add to MetaCart
Clustering analysis is the most significant step in data mining. This paper discusses the kmeans clustering algorithm and various distance functions used in kmeans clustering algorithm such as Euclidean distance function and Manhattan distance function. Experimental results are shown to observe
An Efficient kMeans Clustering Algorithm: Analysis and Implementation
, 2000
"... Kmeans clustering is a very popular clustering technique, which is used in numerous applications. Given a set of n data points in R d and an integer k, the problem is to determine a set of k points R d , called centers, so as to minimize the mean squared distance from each data point to its ..."
Abstract

Cited by 405 (4 self)
 Add to MetaCart
nearest center. A popular heuristic for kmeans clustering is Lloyd's algorithm. In this paper we present a simple and efficient implementation of Lloyd's kmeans clustering algorithm, which we call the filtering algorithm. This algorithm is very easy to implement. It differs from most other
Research and Improvement on KMeans Clustering Algorithm
"... Abstract—According to the defects of classical kmeans clustering algorithm such as sensitive to the initial clustering center selection, the poor global search ability, falling into the local optimal solution. A differential evolution algorithm which was a kind of a heuristic global optimization al ..."
Abstract
 Add to MetaCart
Abstract—According to the defects of classical kmeans clustering algorithm such as sensitive to the initial clustering center selection, the poor global search ability, falling into the local optimal solution. A differential evolution algorithm which was a kind of a heuristic global optimization
The Global KMeans Clustering Algorithm
, 2003
"... We present the global kmeans 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 kmeans algorithm from suitable initial ..."
Abstract

Cited by 130 (6 self)
 Add to MetaCart
We present the global kmeans 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 kmeans algorithm from suitable initial
An efficient kmeans clustering algorithm
 In Proceedings of IPPS/SPDP Workshop on High Performance Data Mining
, 1998
"... In this paper, we present a novel algorithm for performing kmeans clustering. It organizes all the patterns in a kd tree structure such that one can find all the patterns which are closest to a given prototype efficiently. The main intuition behind our approach is as follows. All the prototypes ar ..."
Abstract

Cited by 80 (0 self)
 Add to MetaCart
In this paper, we present a novel algorithm for performing kmeans clustering. It organizes all the patterns in a kd tree structure such that one can find all the patterns which are closest to a given prototype efficiently. The main intuition behind our approach is as follows. All the prototypes
Improving the Accuracy and Efficiency of the kmeans Clustering Algorithm
"... Abstract — Emergence of modern techniques for scientific data collection has resulted in large scale accumulation of data pertaining to diverse fields. Conventional database querying methods are inadequate to extract useful information from huge data banks. Cluster analysis is one of the major data ..."
Abstract

Cited by 34 (0 self)
 Add to MetaCart
analysis methods and the kmeans clustering algorithm is widely used for many practical applications. But the original kmeans algorithm is computationally expensive and the quality of the resulting clusters heavily depends on the selection of initial centroids. Several methods have been proposed
k*Means: A new generalized kmeans clustering algorithm
 Pattern Recognition Letters
"... This paper presents a generalized version of the conventional kmeans clustering algorithm [Proceedings of 5th ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
This paper presents a generalized version of the conventional kmeans clustering algorithm [Proceedings of 5th
Improvement of KMeans clustering Algorithm
"... By the help of large storage capacities of current computer systems, datasets of companies has expanded dramatically in recent years. Rapid growth of current companies ’ databases has raised the need of faster data mining algorithms as time is very critical for those companies. Large amounts of data ..."
Abstract
 Add to MetaCart
of datasets have historical data about the transactions of companies which hold valuable hidden patterns which can provide competitive advantage to them. In this project, Kmeans data mining algorithm has been proposed to be improved in performance in order to cluster large datasets in shorter time. Algorithm
Research on Kmeans clustering algorithm and its implementation
"... Abstract—Kmeans algorithm is a kind of clustering analysis based on partition algorithm, it through constant iteration to clustering, when algorithm converges to an end conditions, and the output iterative process termination clustering results. Because its algorithm is simple, and easy to realize ..."
Abstract
 Add to MetaCart
thoughts of largescale data clustering, so kmeans algorithm has become one of the most commonly used one of the clustering algorithm. Kmeans algorithm can find about clustering error local optimal solution, be applied in many clustering on the question of the rapid iteration algorithm. In this paper, we
Results 1  10
of
1,805,685