Skip to main content

An Illustrative Comparison of Rough k-Means to Classical Clustering Approaches

  • Conference paper
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8170))

Abstract

Rough clustering has gained increasing attention in the last decade with applications in such diverse areas like bioinformatics, traffic control and retail. The relationship between rough clustering and, in particular, fuzzy and possibilistic concepts is still a topic that is raised first and foremost by practitioners who are looking for an adequate clustering algorithm. Therefore, we compare rough k-means to fuzzy c-means, possibilistic c-means and to classical k-means in our paper. We show that rough k-means is closer related to classical k-means than to fuzzy and possibilistic c-means. Besides brief theoretical evaluations we perform illustrative experiments on artificial data and the IRIS data.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bezdek, J., Harris, J.: Fuzzy partitions and relations. Fuzzy Sets and Systems 1(2), 111–127 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Algorithms. Plenum Press, New York (1981)

    Book  MATH  Google Scholar 

  3. Frank, A., Asuncion, A.: UCI Machine Learning Repository (2010)

    Google Scholar 

  4. Jain, A.: Data clustering: 50 years beyond k-means. Pattern Recognition Letters 31, 651–666 (2010)

    Article  Google Scholar 

  5. Krishnapuram, R., Keller, J.M.: A possibilistic approach to clustering. IEEE Transactions on Fuzzy Systems 1(2), 98–110 (1993)

    Article  Google Scholar 

  6. Lingras, P., Peters, G.: Rough clustering. WIREs Data Mining and Knowledge Discovery 1, 64–72 (2011)

    Article  Google Scholar 

  7. Lingras, P., West, C.: Interval set clustering of web users with rough k-means. Journal of Intelligent Information Systems 23, 5–16 (2004)

    Article  MATH  Google Scholar 

  8. MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Fifth Berkeley Symposium on Mathematical Statistics and Probability, Berkeley & Los Angeles, CA, vol. I, pp. 281–297. Univ. of California Press (1967)

    Google Scholar 

  9. Peters, G.: Outliers in rough k-means clustering. In: Pal, S.K., Bandyopadhyay, S., Biswas, S. (eds.) PReMI 2005. LNCS, vol. 3776, pp. 702–707. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Peters, G.: Some refinements of rough k-means. Pattern Recognition 39, 1481–1491 (2006)

    Article  MATH  Google Scholar 

  11. Peters, G., Crespo, F., Lingras, P., Weber, R.: Soft clustering - fuzzy and rough approaches and their extensions and derivatives. International Journal of Approximate Reasoning 54(2), 307–322 (2013)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peters, G., Crespo, F. (2013). An Illustrative Comparison of Rough k-Means to Classical Clustering Approaches. In: Ciucci, D., Inuiguchi, M., Yao, Y., Ślęzak, D., Wang, G. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2013. Lecture Notes in Computer Science(), vol 8170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41218-9_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41218-9_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41217-2

  • Online ISBN: 978-3-642-41218-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics