Abstract
This paper proposes decremental rough possibilitic k-modes (D-RPKM) as a new clustering method for categorical databases. It distinguishes itself from the conventional clustering method in four aspects. First, it can deal with uncertain values of attributes by defining possibility degrees. Then, it handles uncertainty when an object belongs to several clusters using possibilistic membership degrees. It also determines boundary regions through the computing of the approximation sets based on the rough set theory. Finally, it accommodates gradual changes in datasets where there is a decrease in the cluster number. Such a dynamically changing dataset can be seen in numerous real-world situations such as changing behaviour of customers, or popularity of products or when there is, for example, an extinction of some species or diseases. For experiments, we use UCI machine learning repository datasets with different evaluation criteria. Results highlight the effectiveness of the proposed method compared to different versions of k-modes method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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.: 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)
Ammar, A., Elouedi, Z., Lingras, P.: Incremental Rough Possibilistic K-Modes. In: Ramanna, S., Lingras, P., Sombattheera, C., Krishna, A. (eds.) MIWAI 2013. LNCS, vol. 8271, pp. 13–24. Springer, Heidelberg (2013)
Ammar, A., Elouedi, Z., Lingras, P.: Decremental Possibilistic K-Modes. In: Proceedings of the 12th Scandinavian Artificial Intelligence Conference, SCAI, pp. 15–24 (2013)
Langford, T., Giraud-Carrier, C., Magee, J.: Detection of infectious outbreaks in hospitals through incremental clustering. In: Quaglini, S., Barahona, P., Andreassen, S. (eds.) AIME 2001. LNCS (LNAI), vol. 2101, pp. 30–39. Springer, Heidelberg (2001)
Lin, J., Vlachos, M., Keogh, E.J., Gunopulos, D.: Iterative Incremental clustering of time series. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 106–122. Springer, Heidelberg (2004)
Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental clustering and dynamic information retrieval. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 626–635 (1997)
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)
Joshi, M., Lingras, P., Rao, C.R.: Correlating Fuzzy and Rough Clustering. Fundamenta Informaticae 115(2-3), 233–246 (2011)
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 datasets 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)
Lingras, P., Peters, G.: Rough clustering. In: Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, vol. 1, pp. 64–72. John Wiley & Sons, Inc. (2011)
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)
Lingras, P., Nimse, S., Darkunde, N., Muley, A.: Soft clustering from crisp clustering using granulation for mobile call mining. In: Proceedings of the 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)
MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability. Statistics, vol. 1, pp. 281–297 (1967)
Murphy, M.P., Aha, D.W.: UCI repository databases (1996), http://www.ics.uci.edu/mlearn
Pawlak, Z.: Rough Sets. International Journal of Information and Computer Science 11, 341–356 (1982)
Rezanková, H.: Cluster analysis and categorical data. Statistika, roc. 89, 216–232 (2009) ISSN 0322-788X
Rezankova, H., Loster, T., Husek, D.: Evaluation of Categorical Data Clustering. In: Mugellini, E., Szczepaniak, P.S., Pettenati, M.C., Sokhn, M. (eds.) AWIC 2011. AISC, vol. 86, pp. 173–182. Springer, Heidelberg (2011)
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
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Ammar, A., Elouedi, Z., Lingras, P. (2014). Decremental Rough Possibilistic K-Modes. In: Bouchachia, A. (eds) Adaptive and Intelligent Systems. ICAIS 2014. Lecture Notes in Computer Science(), vol 8779. Springer, Cham. https://doi.org/10.1007/978-3-319-11298-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-11298-5_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11297-8
Online ISBN: 978-3-319-11298-5
eBook Packages: Computer ScienceComputer Science (R0)