DocumentCode
124252
Title
On Some Models of Objective-Based Rough Clustering
Author
Kinoshita, Naohiko ; Endo, Yuta ; Miyamoto, Sadaaki
Author_Institution
Grad. Sch. of Syst. & Inf. Eng., Univ. of Tsukuba, Tsukuba, Japan
Volume
2
fYear
2014
fDate
11-14 Aug. 2014
Firstpage
392
Lastpage
399
Abstract
Fuzzy clustering which can implement flexible classification is very useful but sometimes calculates the degrees of belongingness of an objects to a cluster too exactly. To solve this problem, a new clustering method called rough k-means (RKM) is proposed by Lingras et al. RKM which is an extended method by using rough set representation can classify more roughly than fuzzy clustering without lack of flexibility. Generally, non-hierarchical clustering methods including RKM are strongly dependent on initial values. Therefore we need some indicator to evaluate outputs of a method. Many methods define an objective function as the indicator. However conventional rough clustering methods including RKM are not based on an objective function. Thus we cannot evaluate the outputs of them. We solve this problem by defining objective functions clearly and proposing some new objective-based rough clustering methods. In this paper, we introduce these methods classified into three categories, that is metric model, non-metric model and regression model. Moreover we discuss the features of these methods.
Keywords
pattern clustering; regression analysis; rough set theory; metric model; nonmetric model; objective functions; objective-based rough clustering methods; regression model; Approximation algorithms; Approximation methods; Clustering algorithms; Clustering methods; Convergence; Linear programming; Measurement; clustering; non-metric model; regression model; rough set;
fLanguage
English
Publisher
ieee
Conference_Titel
Web Intelligence (WI) and Intelligent Agent Technologies (IAT), 2014 IEEE/WIC/ACM International Joint Conferences on
Conference_Location
Warsaw
Type
conf
DOI
10.1109/WI-IAT.2014.124
Filename
6927651
Link To Document