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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
P. Lingras and G. Peters. Rough clustering. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, Vol. 1, Issue 1, pp. 64–72, pages 1207–1216, 2011.
P. Lingras and C. West. Interval set clustering of web users with rough \(k\)-means. Journal of Intelligent Information Systems, Vol. 23, No. 1, pp. 5–16, 2004.
R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. John Wiley & Sons, New York, second edition, 1973.
J. B. MacQueen. Some methods for classification and analysis of multivariate observations. Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, University of California Press, Vol. 1, pp. 281–297, 1967.
J. C. Dunn. A fuzzy relative of the isodata process and its use in detecting compact well-separated clusters. Journal of Cybernetics, Vol. 3, pp. 32–57, 1973.
J. C. Bezdek. Pattern recognition with fuzzy objective function algorithms. Plenum Press, New York, 1981.
Z. Pawlak. Rough sets. International Journal of Computer and Information Sciences, Vol. 11, No. 5, pp. 341–356, 1982.
M. Inuiguchi. Generalizations of rough sets: From crisp to fuzzy cases. Proceedings of Rough Sets and Current Trends in Computing, pp. 26–37, 2004.
Z. Pawlak. Rough classification. International Journal of Man-Machine Studies, Vol. 20, pp. 469–483, 1984.
S. Hirano and S. Tsumoto. An indiscernibility-based clustering method with iterative refinement of equivalence relations. Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol. 7, No. 2, pp. 169–177, 2003.
S. Mitra, H. Banka, and W. Pedrycz. Rough-fuzzy collaborative clustering. IEEE Transactions on Systems Man, and Cybernetics, Part B, Cybernetics, Vol. 36, No. 5, pp. 795–805, 2006.
P. Maji and S. K. Pal. Rough set based generalized fuzzy \(c\)-means algorithm and quantitative indices. IEEE Transactions on System, Man and Cybernetics, Part B, Cybernetics, Vol. 37, No. 6, pp. 1529–1540, 2007.
G. Peters. Rough clustering and regression analysis. Proceedings RSKT’07, LNAI 2007, Vol. 4481, pp. 292–299, 2007.
S. Mitra and B. Barman. Rough-fuzzy clustering: An application to medical imagery. Rough Set and Knowledge Technology, LNCS 2008, Vol. 5009, pp. 300–307, 2008.
M. Roubens. Pattern classification problems and fuzzy sets, Fuzzy Sets and Systems, Vol. 1, pp. 239–253, 1978.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Endo, Y., Kinoshita, N. (2017). Various Types of Objective-Based Rough Clustering. In: Torra, V., Dahlbom, A., Narukawa, Y. (eds) Fuzzy Sets, Rough Sets, Multisets and Clustering. Studies in Computational Intelligence, vol 671. Springer, Cham. https://doi.org/10.1007/978-3-319-47557-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-47557-8_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-47556-1
Online ISBN: 978-3-319-47557-8
eBook Packages: EngineeringEngineering (R0)