Skip to main content

Robust Fuzzy Relational Clustering of Non-linear Data

  • Conference paper
  • First Online:
Uncertainty Modelling in Data Science (SMPS 2018)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 832))

  • 603 Accesses

Abstract

In many practical situations data may be characterized by non-linear structures. Classical (hard or fuzzy) algorithms, usually based on the Euclidean distance, implicitly lead to spherical shape clusters and, therefore, do not identify clusters properly. In this paper we deal with non-linear structures in clustering by means of the geodesic distance, able to capture and preserve the intrinsic geometry of the data. We introduce a new fuzzy relational clustering algorithm based on the geodesic distance. Furthermore, to improve its adequacy, a robust version is proposed in order to take into account the presence of outliers.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

References

  1. Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319–2323 (2000)

    Article  Google Scholar 

  2. Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5, 345 (1962)

    Article  Google Scholar 

  3. Warshall, S.: A theorem on Boolean matrices. J. ACM. 9, 11–12 (1962)

    Article  MathSciNet  Google Scholar 

  4. Király, A., Vathy-Fogarassy, Á., Abonyi, J.: Geodesic distance based fuzzy \(c\)-medoid clustering - searching forcentral points in graphs and high dimensional data. Fuzzy Sets Syst. 286, 157–172 (2016)

    Article  Google Scholar 

  5. Asgharbeygi, N., Maleki, A.: Geodesic \(k\)-means clustering. In: 19th International Conference on Pattern Recognition, ICPR 2008, Tampa, Florida, pp. 1–4 (2008)

    Google Scholar 

  6. Babaeian, A., Babaee, M., Bayestehtashk, A., Bandarabadi, M.: Nonlinear subspace clustering using curvature constrained distances. Pattern Recognit. Lett. 68, 118–125 (2015)

    Article  Google Scholar 

  7. Karygianni, S., Frossard, P.: Tangent-based manifold approximation with locally linear models. Signal Process. 104, 232–247 (2014)

    Article  Google Scholar 

  8. Runkler, T.A.: Relational fuzzy clustering. In: de Oliveira, J.V., Pedrycz, W. (eds.) Advances in Fuzzy Clustering and Its Applications, pp. 31–51. Wiley, Chichester (2007)

    Chapter  Google Scholar 

  9. Davé, R.N., Sen, S.: Robust fuzzy clustering of relational data. IEEE Trans. Fuzzy Syst. 10, 713–727 (2002)

    Article  Google Scholar 

  10. Davé, R.N.: Characterization and detection of noise in clustering. Pattern Recog. Lett. 12, 657–664 (1991)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maria Brigida Ferraro .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ferraro, M.B., Giordani, P. (2019). Robust Fuzzy Relational Clustering of Non-linear Data. In: Destercke, S., Denoeux, T., Gil, M., Grzegorzewski, P., Hryniewicz, O. (eds) Uncertainty Modelling in Data Science. SMPS 2018. Advances in Intelligent Systems and Computing, vol 832. Springer, Cham. https://doi.org/10.1007/978-3-319-97547-4_12

Download citation

Publish with us

Policies and ethics