Skip to main content

Distance-Based Fuzzy-Rough Sets and Their Application to the Classification Problem

  • Conference paper
  • First Online:
Rough Sets (IJCRS 2024)

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

Included in the following conference series:

  • 229 Accesses

Abstract

We propose distance-based fuzzy-rough sets (DBFR) that rely on distance functions for the granulation of the underlying universe. The classification problem is investigated from a fuzzy perspective and cast as a concept approximation problem. DBFRs are employed to facilitate the approximation process. The geometrical nature of approximation emerging due to the use of distance functions is investigated. Naive classifiers based on DBFRs are proposed and experimentally evaluated on benchmark datasets.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    Binary operations \(E_1\) and \(E_2\) on [0, 1] are called dual wrt negator \(\mathcal {N}\) if the duality identities \(\mathcal {N}(E_1(x,y)) = E_2(\mathcal {N}(x),\mathcal {N}(y))\) and \(\mathcal {N}(E_2(x,y)) = E_1(\mathcal {N}(x),\mathcal {N}(y))\) hold for all \(x,y \in [0,1]\). If \(\mathcal {N}\) is involutive, then \(E_1(x,y) := \mathcal {N}(E_2(\mathcal {N}(x),\mathcal {N}(y)))\) is called \(\mathcal {N}\)-dual of \(E_2\) and \(E_2(x,y) := \mathcal {N}(E_1(\mathcal {N}(x),\mathcal {N}(y)))\) and is called \(\mathcal {N}\)-dual of \(E_1\).

  2. 2.

    The actual theorem is much more general, but we only specify the part relevant to our work.

  3. 3.

    The points in the Fig. 2 are actually the feature vectors of the objects in the toy dataset. For convenience, we won’t explicate the distinction from here on.

  4. 4.

    By “y near class \(D_1\)”, it is meant that the feature vector of y, i.e., \(\phi (y)\) is near feature vector of objects in class \(D_1\), viz. blue points. As the feature space is equipped with a pseudo-metric, talking both “nearness” makes sense. For convenience, we won’t emphasize this technicality from here on.

  5. 5.

    \(\text {dist}(y,T) := \min _{x \in T} d(\phi (x), \phi (y))\).

  6. 6.

    Assuming that the pseudo-metric d is finite-valued which is typically true.

  7. 7.

    The decision boundary can be more finely traced by computing the label of objects with feature vectors separated by a smaller step-size, say, 0.01.

  8. 8.

    All datasets except “Diabetes” are taken from [1] and “Diabetes” dataset, originally from the National Institute of Diabetes and Digestive and Kidney Diseases, is taken from UCI Machine Learning’s Kaggle page.

References

  1. Bache, K., Lichman, M.: UCI machine learning repository (2013). http://archive.ics.uci.edu/ml

  2. Cornelis, C., Verbiest, N., Jensen, R.: Ordered weighted average based fuzzy rough sets. In: Yu, J., Greco, S., Lingras, P., Wang, G., Skowron, A. (eds.) RSKT 2010. LNCS (LNAI), vol. 6401, pp. 78–85. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16248-0_16

    Chapter  Google Scholar 

  3. Baets, D.B., Mesiar, R.: Pseudo-metrics and T-equivalences. J. Fuzzy Math. 5(1997), 471–481 (1997)

    Google Scholar 

  4. D’eer, L., Verbiest, N., Cornelis, C., Godo, L.: A comprehensive study of implicator-conjunctor-based and noise-tolerant fuzzy rough sets: Definitions, properties and robustness analysis. Fuzzy Sets Syst. 275, 1–38 (2015). https://doi.org/10.1016/j.fss.2014.11.018

    Article  MathSciNet  Google Scholar 

  5. Dubois, D., Prade, H.: Rough fuzzy sets and fuzzy rough sets*. Int. J. Gen Syst 17(2–3), 191–209 (1990). https://doi.org/10.1080/03081079008935107

    Article  Google Scholar 

  6. Hu, Q., Yu, D., Pedrycz, W., Chen, D.: Kernelized fuzzy rough sets and their applications. IEEE Trans. Knowl. Data Eng. 23(11), 1649–1667 (2011). https://doi.org/10.1109/TKDE.2010.260

    Article  Google Scholar 

  7. Jensen, R., Cornelis, C.: A new approach to fuzzy-rough nearest neighbour classification. In: Chan, C.-C., Grzymala-Busse, J.W., Ziarko, W.P. (eds.) RSCTC 2008. LNCS (LNAI), vol. 5306, pp. 310–319. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-88425-5_32

    Chapter  Google Scholar 

  8. Klir, G.J., Yuan, B.: Fuzzy Sets and Fuzzy Logic: Theory and Applications. Prentice-Hall (2015)

    Google Scholar 

  9. Lenz, O., Cornelis, C., Peralta, D.: Fuzzy-rough-learn 0.2 : a Python library for fuzzy rough set algorithms and one-class classification. In: 2022 IEEE International Conference On Fuzzy Systems (FUZZ-IEEE), p. 8. IEEE (2022). https://doi.org/10.1109/fuzz-ieee55066.2022.9882778

  10. Lorentey, K.: Capybara (2011). https://flic.kr/p/9wcG1g

  11. Mi, J.S., Zhang, W.X.: An axiomatic characterization of a fuzzy generalization of rough sets. Inf. Sci. 160(1), 235–249 (2004). https://doi.org/10.1016/j.ins.2003.08.017

    Article  MathSciNet  Google Scholar 

  12. Morsi, N.N., Yakout, M.: Axiomatics for fuzzy rough sets. Fuzzy Sets Syst. 100(1), 327–342 (1998). https://doi.org/10.1016/S0165-0114(97)00104-8

    Article  MathSciNet  Google Scholar 

  13. Moser, B.: On the t-transitivity of kernels. Fuzzy Sets Syst. 157(13), 1787–1796 (2006). https://doi.org/10.1016/j.fss.2006.01.007

    Article  MathSciNet  Google Scholar 

  14. Pawlak, Z.: Rough sets. Int. J. Comput. Inform. Sci. 11, 341–356 (1982). https://doi.org/10.1007/BF01001956

    Article  Google Scholar 

  15. Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825–2830 (2011)

    MathSciNet  Google Scholar 

  16. Simmons, C.N.: Feral cat (2013). https://flic.kr/p/goCcNw

  17. Trotman, K.: Wombat! (2006). https://flic.kr/p/khqre

  18. Yao, Y.Y.: Combination of Rough and Fuzzy Sets Based on \(\alpha \)-Level Sets, pp. 301–321. Springer, Boston (1997). https://doi.org/10.1007/978-1-4613-1461-5_15

  19. Yeung, D., Chen, D., Tsang, E., Lee, J., Xizhao, W.: On the generalization of fuzzy rough sets. IEEE Trans. Fuzzy Syst. 13(3), 343–361 (2005). https://doi.org/10.1109/TFUZZ.2004.841734

    Article  Google Scholar 

  20. Zadeh, L.: Fuzzy sets. Inf. Control 8(3), 338–353 (1965). https://doi.org/10.1016/S0019-9958(65)90241-X

    Article  Google Scholar 

Download references

Acknowledgments

Authors would like to thank Dr. Balasubramanian Jayaram for drawing our attention to De Baets & Mesiar’s theorem.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Amrit Kumar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kumar, A., Chatterjee, N. (2024). Distance-Based Fuzzy-Rough Sets and Their Application to the Classification Problem. In: Hu, M., Cornelis, C., Zhang, Y., Lingras, P., Ślęzak, D., Yao, J. (eds) Rough Sets. IJCRS 2024. Lecture Notes in Computer Science(), vol 14839. Springer, Cham. https://doi.org/10.1007/978-3-031-65665-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-65665-1_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-65664-4

  • Online ISBN: 978-3-031-65665-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics