Abstract
This paper investigates the problem of meta-clustering real-world retail datasets based on possibility and rough set theories. We propose a crisp then, a soft meta-clustering methods and we compare and analyze the results of both methods using real-world retail datasets. The main aim of this paper is to prove the performance gain of the soft meta-clustering method compared to the crisp one. Our novel methods combine the advantages of the meta-clustering process and the k-modes method under possibilistic and rough frameworks. Our approaches perform a double clustering (or meta-clustering) using two datasets that depend on each other consisting of the retail datasets. It uses for the meta-clustering a modified version of the k-modes method. For the new crisp meta-clustering method, we use the possibilistic k-modes (PKM) and for the soft method, the k-modes under possibilitic and rough frameworks (KM-PR) is applied.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ammar, A., Elouedi, Z.: A new possibilistic clustering method: the possibilistic k-modes. In: Proceedings of the 12th International Conference of the Italian Association for Artificial Intelligence. LNAI, vol. 6934, pp. 413–419 (2011)
Ammar, A., Elouedi, Z., Lingras, P.: The k-modes method using possibility and rough set theories. In: Proceedings of the IFSA World Congress and NAFIPS Annual Meeting, IFSA/NAFIPS, pp. 1297–1302. IEEE (2013)
Ammar, A., Elouedi, Z., Lingras, P.: Rough possibilistic meta-clustering of retail datasets. In: Proceedings of the 2014 International Conference on Data Science and Advanced Analytics, DSAA 2014, pp. 177–183. IEEE (2014)
Ammar, A., Elouedi, Z., Lingras, P.: Meta-clustering of possibilistically segmented retail datasets. Fuzzy Sets Syst. 286, 173–196 (2016)
Dubois, D., Prade, H.: Possibility Theory: An Approach to Computerized Processing of Uncertainty. Plenium Press, New York (1988)
Jenhani, I., Ben Amor, N., Elouedi, Z., Benferhat, S., Mellouli, K.: Information affinity: a new similarity measure for possibilistic uncertain information. In: Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU. LNAI, vol. 4724, pp. 840–852 (2007)
Joshi, M., Lingras, P., Rao, C.R.: Correlating fuzzy and rough clustering. Fundamenta Informaticae 115, 233–246 (2012)
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)
MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceeding of the 5th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–296 (1967)
Huang, Z.: Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Mining Knowl. Discov. 2, 283–304 (1998)
Pawlak, Z.: Rough sets. Int. J. Inf. Comput. Sci. 11, 341–356 (1982)
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Norwell (1992)
Zadeh, L.A.: Fuzzy sets as a basis for a theory of possibility. In: Fuzzy Sets and Systems, vol. 1, pp. 3–28 (1978)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Ammar, A., Elouedi, Z. (2018). From Crisp to Soft Possibilistic and Rough Meta-clustering of Retail Datasets. In: Abraham, A., Muhuri, P., Muda, A., Gandhi, N. (eds) Intelligent Systems Design and Applications. ISDA 2017. Advances in Intelligent Systems and Computing, vol 736. Springer, Cham. https://doi.org/10.1007/978-3-319-76348-4_47
Download citation
DOI: https://doi.org/10.1007/978-3-319-76348-4_47
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-76347-7
Online ISBN: 978-3-319-76348-4
eBook Packages: EngineeringEngineering (R0)