Abstract

Recently rough cluster algorithm were introduced and successfully applied to real life data. In this paper we analyze the rough k-means introduced by Lingras’ et al. with respect to its compliance to the classical k-means, the numerical stability and its performance in the presence of outliers. We suggest a variation of the algorithm that shows improved results in these circumstances.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Transactions on Pattern Analysis and Machine Intelligence 1, 224–227 (1979)CrossRefGoogle Scholar
  2. 2.
    do Prado, H.A., Engel, P.M., Filho, H.C.: Rough clustering: An alternative to find meaningful clusters by using the reducts from a dataset. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 234–238. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    Haykin, S.: Neural Networks: A Comprehensive Foundation, 2nd edn. Prentice-Hall, Upper Saddle River (1998)Google Scholar
  4. 4.
    Lingras, P., West, C.: Interval set clustering of web users with rough k-means. Technical Report 2002-002, Department of Mathematics and Computer Science, St. Mary’s University, Halifax, Canada (2002)Google Scholar
  5. 5.
    Lingras, P., West, C.: Interval set clustering of web users with rough k-means. Journal of Intelligent Information Systems 23, 5–16 (2004)MATHCrossRefGoogle Scholar
  6. 6.
    Lingras, P., Yan, R., West, C.: Comparison of conventional and rough k-means clustering. In: RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 130–137. Springer, Heidelberg (2003)Google Scholar
  7. 7.
    Mitra, S.: An evolutionary rough partitive clustering. Pattern Recognition Letters 25, 1439–1449 (2004)CrossRefGoogle Scholar
  8. 8.
    Mitra, S., Acharya, T.: Data Mining: Multimedia, Soft Computing, and Bioinformatics. John Wiley, New York (2003)Google Scholar
  9. 9.
    Pawlak, Z.: Rough sets. International Journal of Information and Computer Sciences 11, 145–172 (1982)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Boston (1992)Google Scholar
  11. 11.
    Voges, K.E., Pope, N.K., Brown, M.R.: Cluster Analysis of Marketing Data Examining On-Line Shopping Orientation: A Comparision of k-Means and Rough Clustering Approaches. In: Heuristics and Optimization for Knowledge Discovery, pp. 207–224. Idea Group Publishing, Hershey (2002)Google Scholar
  12. 12.
    Voges, K.E., Pope, N.K., Brown, M.R.: A rough cluster analysis of shopping orientation data. In: Proceedings Australian and New Zealand Marketing Academy Conference, Adelaide, pp. 1625–1631 (2003)Google Scholar
  13. 13.
    Yao, Y.Y., Li, X., Lin, T.Y., Liu, Q.: Representation and classification of rough set models. In: Proceedings Third International Workshop on Rough Sets and Soft Computing, San Jose, CA, pp. 630–637 (1994)Google Scholar
  14. 14.
    Zimmermann, H.J.: Fuzzy Set Theory and its Applications, 4th edn. Kluwer Academic Publishers, Boston (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Georg Peters
    • 1
  1. 1.Department of Computer ScienceMunich University of Applied SciencesMunichGermany

Personalised recommendations