Data clustering algorithms using rough sets

Handbook of Research on Computational Intelligence for Engineering, Science, and Business

Volumn , Issue , 2012, Pages 297-327

  Tripathy, B K ^a   Ghosh, Adhir ^a  

^a VIT UNIVERSITY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84898501985     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4018/978-1-46662-518-1.ch012     Document Type: Chapter

References (60)

1. Asharaf, S., Shevade, S. K., & Murty, N. M. (2005). Rough support vector clustering. Pattern Recognition Letters, 38, 1779-1783.
2. Chaturvedi, A., Green, P., & Carroll, J. (1994). Kmeans, k-medians and k-modes: Special cases of partitioning multiway data. In the Classification Society of North America, Meeting presentation, Huston, TX.
3. Chaturvedi, A., Green, P., & Carroll, J. (2001). K-modes clustering. Journal of Classification, 18, 35-55.
4. Chen, K., & Liu, L. (2009). "Best K": Critical clustering structures in categorical datasets. Knowledge and Information Systems, 20, 1-33. doi:10.1007/s10115-008-0159-x
5. Dempster, A., Laird, N., & Rubin, D. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society. Series A (General), 39(1), 1-38.
6. Ganti, V., Gehrke, J., & Ramakrishnan, R. (1999). CACTUS - Clustering categorical data using summaries. In Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (pp. 73-83).
7. Gibson, D., Kleinberg, J., & Raghavan, P. (2000). Clustering categorical data: An approach based on dynamical systems. The Very Large Data Bases Journal, 8(3-4), 222-236d. doi:10.1007/s007780050005
8. Guha, S., Rastogi, R., & Shim, K. (2000). ROCK: A robust clustering algorithm for categorical attributes. Information Systems, 25(5), 345-366. doi:10.1016/S0306-4379(00)00022-3
9. Haimov, S., Michalev, M., Savchenko, A., & Yordanov, O. (1989). Classification of radar signatures by autoregressive model fitting and cluster analysis. IEEE Transactions on Geoscience and Remote Sensing, 8(1), 606-610. doi:10.1109/TGRS.1989.35943
10. Halkidi, M., Batistakis, Y., & Vazirgiannis, M. (2001). On clustering validation techniques. Journal of Intelligent Information Systems, 17(2-3), 107-145. doi:10.1023/A:1012801612483
11. Han, E., Karypis, G., Kumar, V., & Mobasher, B. (1997). Clustering based on association rule hyper graph. In Workshop on Research Issues on Data Mining and Knowledge Discovery, (pp. 9-13).
12. Hartigan, J. A., & Wong, M. A. (1979). Algorithm AS136: A k-means clustering algorithm. Applied Statistics, 28, 100-108. doi:10.2307/2346830
13. He, Z., Xu, X., & Deng, S. (2002). Squeezer: An efficient algorithm for clustering categorical data. Journal of Computer Science & Technology, 17(5), 611-624. doi:10.1007/BF02948829
14. He, Z., Xu, X., & Deng, S. (2004). A link clustering based approach for clustering categorical data. Proceedings of the WAIM Conference. Retrieved from http://xxx.sf.nchc.org.tw/ftp/cs/papers/0412/0412019.pdf
15. Herawan, T., Ghazali, R., Yanto, I. T. R., & Deris, M. M. (2010). Rough set approach for categorical data clustering. International Journal of Database Theory and Application, 3(1), 33-51.
16. Hirano, S., & Tsumoto, S. (2000). Rough clustering and its application to medicine. Information Sciences, 124, 125-137.
17. Huang, Z. (1998). Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Mining and Knowledge Discovery, 2(3), 283-304. doi:10.1023/A:1009769707641
18. Jiang, D., Tang, C., & Zhang, A. (2004). Cluster analysis for gene expression data: A survey. IEEE Transactions on Knowledge and Data Engineering, 16(11), 1370-1386. doi:10.1109/TKDE.2004.68
19. Johnson, R., & Wichern, W. (2002). Applied multivariate statistical analysis. New York, NY: Prentice Hall.
20. Kaufman, L., & Rousseeuw, P. J. (2005). Finding groups in data: An introduction to cluster analysis (2nd ed.). New York, NY: John Wiley & Sons.
21. Kim, D., Lee, K., & Lee, D. (2004). Fuzzy clustering of categorical data using fuzzy centroid. Pattern Recognition Letters, 25(11), 1263-1271. doi:10.1016/j.patrec.2004.04.004
22. Kohonen, T. (1988). Self-organization and associative memory. Berlin, Germany: Springer. doi:10.1007/978-3-662-00784-6
23. Krishnapuram, R., Frigui, H., & Nasraoui, O. (1995). Fuzzy and possibilistic shell clustering algorithms and their application to boundary detection and surface approximation. IEEE Transactions on Fuzzy Systems, 3(1), 29-60. doi:10.1109/91.366564
24. Krishnapuram, R., & Keller, J. (1993). A possibilistic approach to clustering. IEEE Transactions on Fuzzy Systems, 1(2), 98-110. doi:10.1109/91.227387
25. Lingras, P. (2001). Unsupervised rough set classification using GAs. Journal of Intelligent Information Systems, 16(3), 215-228. doi:10.1023/A:1011219918340
26. Lingras, P. (2007). Applications of rough set based k-means. Kohonen SOM, GA clustering. In Peters, J., Skowron, A., Marek, V., Orlowska, E., Slowinski, R., & Ziarko, W. (Eds.), Transactions on Rough Sets VII, LNCS (Vol. 4400, pp. 120-139). Heidelberg, Germany: Springer. doi:10.1007/978-3-540-71663-1_8
27. Lingras, P., Chen, M., & Miao, D. (2008). Precision of rough set clustering. In Chan, C. C. (Eds.), RSCTC 2008, LNAI 5306 (pp. 369-378).
28. Lingras, P., Hogo, M., & Snorek, M. (2004). Interval set clustering of web users using modified Kohonen self-organizing maps based on the properties of rough sets. Web Intelligence and Agent Systems, 2(3), 217-225.
29. Lingras, P., Hogo, M., Snorek, M., & West, C. (2005). Temporal analysis of clusters of super-market customers: Conventional versus interval set approach. Information Science, 172, 215-240. doi:10.1016/j.ins.2004.12.007
30. Lingras, P., & Peters, G. (2011). Rough clustering. [John Wiley and Sons, Inc.]. WIREs Data Mining Knowledge Discovery, 1, 64-72. doi:10.1002/widm.16
31. Lingras, P., & West, C. (2004). Interval set clustering of web users with rough K-means. Journal of Intelligent Information Systems, 23(1), 5-16. doi:10.1023/B:JIIS.0000029668.88665.1a
32. Lingras, P., Yan, P. R., & Hogo, M. (2003). Rough set based clustering: Evolutionary, neural, and statistical approaches. Proceedings of the First Indian International Conference on Artificial Intelligence, (pp. 1074-1087).
33. Lingras, P., Yan, R., & West, C. (2003). Comparison of conventional and rough k-means clustering. In Wang, G., Lin, Q., Yao, Y., & Skowron, A. (Eds.), RSFDGrC 2003, LNCS (LNAI) (Vol. 2639, pp. 130-137). Heidelberg, Germany: Springer. doi:10.1007/3-540-39205-X_17
34. Lloyd, S. P. (1982). Least square quantization in PCM. IEEE Transactions on Information Theory, 28, 128-137. doi:10.1109/TIT.1982.1056489
35. th Berkley Symposium on Mathematical Statistics and Probability, (pp. 281-297). Univ. of California Press.
36. Mathieu, R., & Gibson, J. (2004). A methodology for large scale R&D planning based on cluster analysis. IEEE Transactions on Engineering Management, 40(3), 283-292. doi:10.1109/17.233190
37. th International Conference (CAINE-2000), (pp. 1-6).
38. Mitra, S. (2004). An evolutionary rough partitive clustering. Pattern Recognition Letters, 25, 1439-1449. doi:10.1016/j.patrec.2004.05.007
39. Mitra, S., Bank, H., & Pedrycz, W. (2008). Rough-fuzzy collaborative clustering. IEEE Transactions on Systems, Man, and Cybernetics, 36(4), 787-795.
40. Nguyen, H. S. (2007). Rough document clustering and the internet. In Pedrycz, W., Skowron, A., & Kreinovich, V. (Eds.), Handbook of granular computing. Wiley.
41. Parmar, D., Wu, T., & Blackhurst, J. (2007). MMR: An algorithm for clustering categorical data using Rough Set Theory. Data & Knowledge Engineering, 63, 879-893. doi:10.1016/j.datak.2007.05.005
42. Pawlak, Z. (1982). Rough sets. International Journal of Information and Computer Science, 11, 341-356. doi:10.1007/BF01001956
43. Pawlak, Z. (1991). Rough sets: Theoretical aspects of reasoning about data. Dordrecht, The Netherlands: Kluwer Academic Publishers.
44. Peters, G. (2006). Some refinements of rough kmeans. Pattern Recognition, 39(8), 1481-1491. doi:10.1016/j.patcog.2006.02.002
45. Peters, G., & Lampart, M. (2006). A partitive rough clustering algorithm. Proceedings RSCTC '06, LNAI 4259, (pp. 657-666).
46. Peters, G., Lampart, M., & Weber, R. (2007). Evolutionary rough k-medoids clustering. In Peters, J., Skowron, A., Marek, V., Orlowska, E., Slowinski, R., & Ziarko, W. (Eds.), Transactions on Rough Sets VII, LNCS (Vol. 4400, pp. 289-306). Heidelberg, Germany: Springer.
47. Peters, G., Lampart, M., & Weber, R. (2008). Evolutionary rough k-medoids clustering. Transactions on Rough Sets, VIII, 289-306.
48. Peters, G., & Weber, R. (2008). A dynamic approach to rough clustering. In Chan, C. C. (Eds.), RSCTC 2008, LNAI 5306 (pp. 379-388).
49. Ralambondrainy, H. (1995). A conceptual version of the K-means algorithm. Pattern Recognition Letters, 16(11), 1147-1157. doi:10.1016/0167-8655(95)00075-R
50. Ruspini, E. (1969). A new approach to clustering. Information and Control, 15(1), 22-32. doi:10.1016/S0019-9958(69)90591-9
51. Tripathy, B. K., & Ghosh, A. (2011a). SDR: An algorithm for clustering categorical data using rough set theory. IEEE Transaction on Recent Advances in Intelligent Computational Systems (pp. 67-872). RAICS.
52. Tripathy, B. K., & Ghosh, A. (2011b). SSDR: An algorithm for clustering categorical data using rough set theory. Journal of Advances in Applied Science Research, 2(3), 314-326.
53. Tripathy, B. K., & Kumar, P. (2009). MMeR: An algorithm for clustering heterogeneous data using rough set theory. The International Journal of Rapid Manufacturing Special Issue on Data Mining, 1(2), 189-207.
54. Voges, K., & Pope, N. (2004). Generating compact rough cluster descriptions using an evolutionary algorithm. In Deb, K. (Ed.), GECCO2004: Genetic and Evolutionary Algorithm Conference - LNCS (pp. 1332-1333). Berlin, Germany: Springer-Verlag. doi:10.1007/978-3-540-24855-2_152
55. Voges, K., Pope, N., & Brown, M. (2002). Cluster analysis of marketing data examining on-line shopping orientation: A comparison of K-means and rough clustering approaches. In Abbass, H. A., Sarkar, R. A., & Newton, C. S. (Eds.), Heuristics and Optimization for Knowledge Discovery (pp. 207-224). Hershey, PA: Idea Group Publishing.
56. Wong, K., Feng, D., Meikle, S., & Fulham, M. (2002). Segmentation of dynamic pet images using cluster analysis. IEEE Transactions on Nuclear Science, 49(1), 200-207. doi:10.1109/TNS.2002.998752
57. Wu, S., Liew, A., Yan, H., & Yang, M. (2004). Cluster analysis of gene expression data based on self-splitting and merging competitive learning. IEEE Transactions on Information Technology in Biomedicine, 8(1), 5-15. doi:10.1109/TITB.2004.824724
58. Zadeh, L. A. (1965). Fuzzy sets. Information and Control, 11, 338-353. doi:10.1016/S0019-9958(65)90241-X
59. Zaki, M. J., Peters, M., Assent, I., & Seidl, T. (2007). Clicks: An efficient algorithm for mining subspace clusters in categorical data sets. Data & Knowledge Engineering, 60(1), 51-70. doi:10.1016/j.datak.2006.01.005
60. Zhang, Y., Fu, A., Cai, C., & Heng, P. (2000). Clustering categorical data. In Proceedings of the 16th International Conference on Data Engineering, (pp. 305-324).