Abstract
Clustering categorical data sets under uncertain framework is a fundamental task in data mining area. In this paper, we propose a new method based on the k-modes clustering method using rough set and possibility theories in order to cluster objects into several clusters. While possibility theory handles the uncertainty in the belonging of objects to different clusters by specifying the possibilistic membership degrees, rough set theory detects and clusters peripheral objects using the upper and lower approximations. We introduce modifications on the standard version of the k-modes approach (SKM) to obtain the rough possibilistic k-modes method denoted by RPKM. These modifications make it possible to classify objects to different clusters characterized by rough boundaries. Experimental results on benchmark UCI data sets indicate the effectiveness of our proposed method i.e. RPKM.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ammar, A., Elouedi, Z.: A New Possibilistic Clustering Method: The Possibilistic K-Modes. In: Pirrone, R., Sorbello, F. (eds.) AI*IA 2011. LNCS, vol. 6934, pp. 413–419. Springer, Heidelberg (2011)
Ammar, A., Elouedi, Z., Lingras, P.: K-Modes Clustering Using Possibilistic Membership. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds.) IPMU 2012, Part III. CCIS, vol. 299, pp. 596–605. Springer, Heidelberg (2012)
Joshi, M., Lingras, P., Rao, C.R.: Correlating Fuzzy and Rough Clustering. Fundamenta Informaticae (2011) (in press)
Lingras, P., Nimse, S., Darkunde, N., Muley, A.: Soft clustering from crisp clustering using granulation for mobile call mining. In: Proceedings of the GrC 2011: International Conference on Granular Computing, pp. 410–416 (2011)
Lingras, P., West, C.: Interval Set Clustering of Web Users with Rough K-means. Journal of Intelligent Information Systems 23, 5–16 (2004)
Lingras, P., Hogo, M., Snorek, M., Leonard, B.: Clustering Supermarket Customers Using Rough Set Based Kohonen Networks. In: Zhong, N., Raś, Z.W., Tsumoto, S., Suzuki, E. (eds.) ISMIS 2003. LNCS (LNAI), vol. 2871, pp. 169–173. Springer, Heidelberg (2003)
MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceeding of the 5th Berkeley Symposium on Math., Stat. and Prob., pp. 281–296 (1967)
Murphy, M.P., Aha, D.W.: Uci repository databases (1996), http://www.ics.uci.edu/mlearn
Huang, Z.: Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Mining and Knowledge Discovery 2, 283–304 (1998)
Huang, Z., Ng, M.K.: A note on k-modes clustering. Journal of Classification 20, 257–261 (2003)
Pal, N.R., Pal, K., Keller, J.M., Bezdek, J.C.: A possibilistic fuzzy c-means clustering algorithm. IEEE Transactions on Fuzzy Systems, 517–530 (2005)
Zadeh, L.A.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems 1, 3–28 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ammar, A., Elouedi, Z., Lingras, P. (2012). RPKM: The Rough Possibilistic K-Modes. In: Chen, L., Felfernig, A., Liu, J., Raś, Z.W. (eds) Foundations of Intelligent Systems. ISMIS 2012. Lecture Notes in Computer Science(), vol 7661. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34624-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-34624-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34623-1
Online ISBN: 978-3-642-34624-8
eBook Packages: Computer ScienceComputer Science (R0)