scispace - formally typeset
Book ChapterDOI

Various Types of Objective-Based Rough Clustering

TLDR
This paper shows some rough clustering algorithms which is based on optimization of an objective function, which could provide a solution that is less restrictive than conventional clustering and less descriptive than fuzzy clustering.
Abstract
Conventional clustering algorithms classify a set of objects into some clusters with clear boundaries, that is, one object must belong to one cluster. However, many objects belong to more than one cluster in real world since the boundaries of clusters generally overlap with each other. Fuzzy set representation of clusters makes it possible for each object to belong to more than one cluster. On the other hand, it is pointed out that the fuzzy degree is sometimes regarded as too descriptive for interpreting clustering results. Instead of fuzzy representation, rough set one could deal with such cases. Clustering based on rough set could provide a solution that is less restrictive than conventional clustering and less descriptive than fuzzy clustering. Therefore, Lingras et al. (Lingras and Peters, Wiley Interdiscip Rev: Data Min Knowl Discov 1(1):64–72, 1207–1216, 2011, [1] and Lingras and West, J Intell Inf Syst 23(1):5–16, 2004, [2]) proposed a clustering method based on rough set, rough K-means (RKM). RKM is almost only one algorithm inspired by KM and some assumptions of RKM are very natural, however it is not useful from the viewpoint that the algorithm is not based on any objective functions. Outputs of non-hierarchical clustering algorithms strongly depend on initial values and the “better” output among many outputs from different initial values should be chosen by comparing the value of the objective function of the output with each other. Therefore the objective function plays very important role in clustering algorithms. From the standpoint, we have proposed some rough clustering algorithms based on objective functions. This paper shows such rough clustering algorithms which is based on optimization of an objective function.

read more

Citations
More filters
Journal ArticleDOI

Objective function-based rough membership C-means clustering

TL;DR: A novel RMCM framework, which is called R MCM version 2 (RMCM2), based on an objective function is proposed, designed to derive the same updating rule for cluster centers as in RMCm.
Journal ArticleDOI

Rough Set-Based Clustering Utilizing Probabilistic Memberships

TL;DR: This study considers rough set-based clustering approaches that utilize probabilistic memberships as variants of GRCM and RSCM, including π generalized rough C-means (πGRCM), π rough set C-measures (πRSCM), and rough membership C-Means (RMCM).
Journal ArticleDOI

Characteristics of Rough Set C-Means Clustering

TL;DR: RSCM is proposed as a clustering model on an approximation space considering a space granulated by a binary relation and uses the lower and the upper approximations of temporal clusters.
References
More filters

Some methods for classification and analysis of multivariate observations

TL;DR: The k-means algorithm as mentioned in this paper partitions an N-dimensional population into k sets on the basis of a sample, which is a generalization of the ordinary sample mean, and it is shown to give partitions which are reasonably efficient in the sense of within-class variance.
Book

Pattern Recognition with Fuzzy Objective Function Algorithms

TL;DR: Books, as a source that may involve the facts, opinion, literature, religion, and many others are the great friends to join with, becomes what you need to get.
Book

Pattern classification and scene analysis

TL;DR: In this article, a unified, comprehensive and up-to-date treatment of both statistical and descriptive methods for pattern recognition is provided, including Bayesian decision theory, supervised and unsupervised learning, nonparametric techniques, discriminant analysis, clustering, preprosessing of pictorial data, spatial filtering, shape description techniques, perspective transformations, projective invariants, linguistic procedures, and artificial intelligence techniques for scene analysis.
Journal ArticleDOI

Rough sets

TL;DR: This approach seems to be of fundamental importance to artificial intelligence (AI) and cognitive sciences, especially in the areas of machine learning, knowledge acquisition, decision analysis, knowledge discovery from databases, expert systems, decision support systems, inductive reasoning, and pattern recognition.
Related Papers (5)