PERBANDINGAN ANTARA METODE K-MEANS CLUSTERING DENGAN GATH-GEVA CLUSTERING
نویسندگان
چکیده
منابع مشابه
Modified Gath-Geva clustering for fuzzy segmentation of multivariate time-series
The partitioning of a time-series into internally homogeneous segments is an important data mining problem. The changes of the variables of a multivariate time-series are usually vague and do not focus on any particular time point. Therefore it is not practical to define crisp bounds of the segments. Although fuzzy clustering algorithms are widely used to group overlapping and vague objects, th...
متن کاملModified Gath-Geva fuzzy clustering for identification of Takagi-Sugeno fuzzy models
The construction of interpretable Takagi-Sugeno (TS) fuzzy models by means of clustering is addressed. First, it is shown how the antecedent fuzzy sets and the corresponding consequent parameters of the TS model can be derived from clusters obtained by the Gath-Geva (GG) algorithm. To preserve the partitioning of the antecedent space, linearly transformed input variables can be used in the mode...
متن کامل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...
متن کاملAdaptive K-Means Clustering
Clustering is used to organize data for efficient retrieval. One of the problems in clustering is the identification of clusters in given data. A popular technique for clustering is based on K-means such that the data is partitioned into K clusters. In this method, the number of clusters is predefined and the technique is highly dependent on the initial identification of elements that represent...
متن کاملConstrained K-Means Clustering
We consider practical methods for adding constraints to the K-Means clustering algorithm in order to avoid local solutions with empty clusters or clusters having very few points. We often observe this phenomena when applying K-Means to datasets where the number of dimensions is n 10 and the number of desired clusters is k 20. We propose explicitly adding k constraints to the underlying clusteri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Matematika "MANTIK"
سال: 2016
ISSN: 2527-3167,2527-3159
DOI: 10.15642/mantik.2016.1.2.26-37