Abstract
Clustering is a very useful tool of data mining. A clustering method which is referred to as K-member clustering is to classify a dataset into some clusters of which the size is more than a given constant K. The K-member clustering is useful and it is applied to many applications. Naturally, clustering methods to classify a dataset into some even-sized clusters can be considered and some even-sized clustering methods have been proposed. However, conventional even-sized clustering methods often output inadequate results. One of the reasons is that they are not based on optimization. Therefore, we proposed Even-sized Clustering Based on Optimization (ECBO) in our previous study. The simplex method is used to calculate the belongingness of each object to clusters in ECBO. In this study, ECBO is extended by introducing some ideas which were introduced in k-means or fuzzy c-means to improve problems of initial-value dependence, robustness against outliers, calculation cost, and nonlinear boundaries of clusters. Moreover, we reconsider the relation between the dataset size, the cluster number, and K in ECBO.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ogata, Y., Endo, Y.: A note on the \(K\)-member clustering problem. In: The 29th Fuzzy System Symposium (FSS), MB2-2 (2013). (in Japanese)
Hirano, T., Endo, Y., Kinoshita, N., Hamasuna, Y.: On even-sized clustering algorithm based on optimization. In: Proceedings of Joint 7rd International Conference on Soft Computing and Intelligent Systems and 15th International Symposium on advanced Intelligent Systems (SCIS & ISIS), TP4-3-5-(3), #69 (2014)
Arthur, D., Vassilvitskii, S.: \(k\)-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics Philadelphia, PA, USA (2007)
Miyamoto, S., Agusta, Y.: An efficient algorithm for \(l_1\) fuzzy \(c\)-means and its termination. Control Cybern. 24, 421–436 (1995)
Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York (1990)
Park, H.-S., Jun, C.-H.: Simple and fast algorithm for \(k\)-medoids clustering. Expert Syst. Appl. 36(2), 3336–3341 (2009)
Girolami, M.: Mercer kernel-based clustering in feature space. IEEE Trans. Neural Netw. 13(3), 780–784 (2002)
Byun, J.-W., Kamra, A., Bertino, E., Li, N.: Efficient k-anonymization using clustering techniques. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 188–200. Springer, Heidelberg (2007)
Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2, 193–218 (1985)
Endo, Y., Miyamoto, S.: Spherical k-means++ clustering. In: Torra, V., Narukawa, T. (eds.) MDAI 2015. LNCS, vol. 9321, pp. 103–114. Springer, Heidelberg (2015)
Acknowledgment
We would like to thank gratefully and sincerely Professor Emeritus Sadaaki Miyamoto of University of Tsukuba, Japan, Professor Vicenç Torra of University of Skövde, Sweden, and Associate Professor Yuchi Kanzawa of Shibaura Institute of Technology, Japan, for their advice. This study was supported by JSPS KAKENHI Grant Numbers JP26330270, JP26330271, and JP16K16128.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Endo, Y., Hirano, T., Kinoshita, N., Hamasuna, Y. (2016). On Various Types of Even-Sized Clustering Based on Optimization. In: Torra, V., Narukawa, Y., Navarro-Arribas, G., Yañez, C. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2016. Lecture Notes in Computer Science(), vol 9880. Springer, Cham. https://doi.org/10.1007/978-3-319-45656-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-45656-0_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45655-3
Online ISBN: 978-3-319-45656-0
eBook Packages: Computer ScienceComputer Science (R0)