Dsmk-Means “Density-Based Split-And-Merge K-Means Clustering Algorithm”
نویسندگان
چکیده
منابع مشابه
Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملpersistent k-means: stable data clustering algorithm based on k-means algorithm
identifying clusters or clustering is an important aspect of data analysis. it is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. it is a main task of exploratory data mining, and a common technique for statistical data analysis this paper proposed an improved version of k-means algorithm, namely persistent k...
متن کاملEnhanced Clustering Based on K-means Clustering Algorithm and Proposed Genetic Algorithm with K-means Clustering
-In this paper targeted a variety of techniques, tactics and distinctive areas of the studies that are useful and marked because the crucial discipline of information mining technologies. The overall purpose of the system of statistics mining is to extract beneficial facts from a large set of information and changing it right into a shape that is comprehensible for in addition use. Clustering i...
متن کاملA Novel Density based improved k-means Clustering Algorithm – Dbkmeans
Mining knowledge from large amounts of spatial data is known as spatial data mining. It becomes a highly demanding field because huge amounts of spatial data have been collected in various applications ranging from geo-spatial data to bio-medical knowledge. The amount of spatial data being collected is increasing exponentially. So, it far exceeded human’s ability to analyze. Recently, clusterin...
متن کاملFurther heuristics for $k$-means: The merge-and-split heuristic and the $(k, l)$-means
The k-means clustering problem asks to partition the data into k clusters so as to minimize the sum of the squared Euclidean distances of the data points to their closest cluster center. Finding the optimal k-means clustering of a d-dimensional data set is NP-hard in general and many heuristics have been designed for minimizing monotonically the k-means objective function. Those heuristics got ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence and Soft Computing Research
سال: 2013
ISSN: 2083-2567
DOI: 10.2478/jaiscr-2014-0005