Abstract
This paper proposes two clustering algorithms of twofold memberships for each cluster. One uses a membership similar to that in K-means, while another membership is defined for a core of a cluster, which is compared to the lower approximation of a cluster in rough K-means. Two ideas for the lower approximation are proposed in this paper: one uses a neighborhood of a cluster boundary and another uses a simple circle from a cluster center. By using the two memberships, two alternate optimization algorithms are proposed. Numerical examples show the effectiveness of the proposed algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Kluwer, Alphen aan den Rijn (1981)
Dave, R.N.: Characterization and detection of noise in clustering. Pattern Recog. Lett. 12(11), 657–664 (1991)
Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193–218 (1985)
Kinoshita, N., Endo, Y., Miyamoto, S.: On some models of objective-based rough clustering. In: Proceedings of 2014 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technologies, 11–14 August 2014, Warsaw, Poland (2014)
Kohonen, T.: Self-organizing Maps. Springer, Heidelberg (1995). https://doi.org/10.1007/978-3-642-97610-0
Lingras, P., West, C.: Interval set clustering of web users with rough k-means. J. Intell. Inf. Syst. 23, 5–16 (2004)
MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281–297. University of California Press (1967)
Miyamoto, S., Ichihashi, H., Honda, K.: Algorithms for Fuzzy Clustering. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78737-2
Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341–356 (1982)
Rand, W.M.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336), 846–850 (1971)
Ubukata, S., Notsu, A., Honda, K.: The rough set \(k\)-means clustering. In: Proceedings of SCIS-ISIS, pp. 189–193 (2016)
Acknowledgment
This paper is based upon work supported in part by the Air Force Office of Scientific Research/Asian Office of Aerospace Research and Development (AFOSR/AOARD) under award number FA2386-17-1-4046.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Miyamoto, S., Choi, J.M., Endo, Y., Huynh, V.N. (2018). Optimal Clustering with Twofold Memberships. In: Torra, V., Narukawa, Y., Aguiló, I., González-Hidalgo, M. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2018. Lecture Notes in Computer Science(), vol 11144. Springer, Cham. https://doi.org/10.1007/978-3-030-00202-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-00202-2_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00201-5
Online ISBN: 978-3-030-00202-2
eBook Packages: Computer ScienceComputer Science (R0)