Abstract
Outlier detection is an important data mining task with applications in various domains. Mining of outliers in data has to deal with uncertainty regarding the membership of such outlier objects to one of the normal groups (classes) of objects. In this context, a soft computing approach based on rough sets happens to be a better choice to handle such mining tasks. Motivated by this requirement, a novel rough clustering algorithm is proposed here by modifying the basic k-modes algorithm to incorporate the lower and upper approximation properties of rough sets. The proposed algorithm includes the necessary computational steps required for determining the object assignment to various clusters and the modified centroid (mode) computation on categorical data. An experimental evaluation of the proposed rough k-modes algorithm is also presented here to demonstrate its performance in detecting outliers using various benchmark categorical data sets.
Chapter PDF
Similar content being viewed by others
References
Albanese, A., Pal, S.K., Petrosino, A.: Rough sets, kernel set and spatio-temporal outlier detection. IEEE Trans. on Knowledge and Data Engineering (2012) (online)
Asuncion, A., Newman, D.J.: UCI machine learning repository (2007), http://archive.ics.uci.edu/ml
Cao, F., Liang, J., Bai, L.: A new initialization method for categorical data clustering. Expert Systems with Applications 36, 10223–10228 (2009)
Huang, Z.: A fast clustering algorithm to cluster very large categorical data sets in data mining. In: SIGMOD DMKD Workshop, pp. 1–8 (1997)
Lingras, P., Peters, G.: Applying rough set concepts to clustering. In: Rough Sets: Selected Methods and Applications in Management and Engineering, pp. 23–38. Springer, London (2012)
Ng, M.K., Li, M.J., Huang, J.Z., He, Z.: On the impact of dissimilarity measure in k-modes clustering algorithm. IEEE PAMI 29(3), 503–507 (2007)
Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)
Peters, G.: Some refinements of rough k-means clustering. Pattern Recognition 39, 1481–1491 (2006)
Suri, N.N.R.R., Murty, M.N., Athithan, G.: Data mining techniques for outlier detection. In: Visual Analytics and Interactive Technologies: Data, Text and Web Mining Applications, ch. 2, pp. 22–38. IGI Global, New York (2011)
Suri, N.N.R.R., Murty, M.N., Athithan, G.: An algorithm for mining outliers in categorical data through ranking. In: IEEE HIS, Pune, India, pp. 247–252 (2012)
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
Suri, N.N.R.R., Murty, M.N., Athithan, G. (2013). A Rough Clustering Algorithm for Mining Outliers in Categorical Data. In: Maji, P., Ghosh, A., Murty, M.N., Ghosh, K., Pal, S.K. (eds) Pattern Recognition and Machine Intelligence. PReMI 2013. Lecture Notes in Computer Science, vol 8251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45062-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-45062-4_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45061-7
Online ISBN: 978-3-642-45062-4
eBook Packages: Computer ScienceComputer Science (R0)