Abstract
In this paper, we develop a new clustering method combining the possibility theory with the standard k-modes method (SKM). The proposed method is called KM-PF to express the fact that it is a modification of k-modes algorithm under possibilistic framework. KM-PM incorporates possibilistic theory in two distinct stages in application of the SKM combining the possibilistic k-modes (PKM) and the k-modes using possibilistic membership (KM-PM). First, it deals with uncertain attribute values of instances using possibilistic distributions. Then, it computes the possibilistic membership degrees of each object to all clusters. Experimental results show that the proposed method compares favourably to the SKM, PKM and KM-PM.
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 (LNAI), 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)
Ammar, A., Elouedi, Z., Lingras, P.: RPKM: The Rough Possibilistic K-Modes. In: Chen, L., Felfernig, A., Liu, J., Raś, Z.W. (eds.) ISMIS 2012. LNCS, vol. 7661, pp. 81–86. Springer, Heidelberg (2012)
Dubois, D., Prade, H.: Possibility theory: An approach to computerized processing of uncertainty. Plenum Press (1988)
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)
Jenhani, I., Ben Amor, N., Elouedi, Z., Benferhat, S., Mellouli, K.: Information affinity: A new similarity measure for possibilistic uncertain information. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol. 4724, pp. 840–852. Springer, Heidelberg (2007)
Krishnapuram, R., Keller, J.M.: A possibilistic approach to clustering. IEEE Trans. Fuzzy System 1, 98–110 (1993)
MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceeding of the Fifth 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
Zadeh, L.A.: Fuzzy sets. Information And Control 8, 338–353 (1965)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ammar, A., Elouedi, Z., Lingras, P. (2013). The K-Modes Method under Possibilistic Framework. In: Zaïane, O.R., Zilles, S. (eds) Advances in Artificial Intelligence. Canadian AI 2013. Lecture Notes in Computer Science(), vol 7884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38457-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-38457-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38456-1
Online ISBN: 978-3-642-38457-8
eBook Packages: Computer ScienceComputer Science (R0)