Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Rules Induced Using Possible Coverings from Incomplete Data Sets

  • Conference paper
  • First Online:
Intelligent and Fuzzy Techniques for Emerging Conditions and Digital Transformation (INFUS 2021)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 307))

Included in the following conference series:

  • 1062 Accesses

Abstract

Rules induced from rough sets are described by an approach using possible coverings in an incomplete data set with similarity of values. In a complete data set only one covering is derived, whereas lots of possible coverings are derived in an incomplete data set. This seems to present some difficulties due to computational complexity, but it is not. No difficulty comes from the lattice structure that the family of possible coverings has. Four approximations that rough sets are consisted of are derived by using only two coverings: the minimum and maximum possible ones. Four types of rules can be induced from the approximations. So, we can derive the rules without worrying about computational complexity coming from the number of values with incomplete information.

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

Similar content being viewed by others

Notes

  1. 1.

    Unless confused, \(R_{a_{i}}\) is used.

  2. 2.

    \(\delta \) is used in place of \(\delta _{a_{i}}\) if no confusion.

  3. 3.

    Therefore, \(R_{a_{i}}^{\delta }\) becomes a tolerance relation [5].

  4. 4.

    C(o) or \(C(o)_{a_{i}}\) is used in place of \(C(o)_{a_{i}}^{\delta }\) if no confusion.

  5. 5.

    \(\sqsubseteq \) is defined as \(\mathcal{E} \sqsubseteq \mathcal{E'}\) if \(\forall E \in \mathcal{E} \exists E' \in \mathcal{E'} \wedge E \subseteq E'\).

References

  1. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991). https://doi.org/10.1007/978-94-011-3534-4

    Book  MATH  Google Scholar 

  2. Kryszkiewicz, M.: Rules in incomplete information systems. Inf. Sci. 113, 271–292 (1999)

    Article  MathSciNet  Google Scholar 

  3. Nakata, M., Sakai, H.: Applying rough sets to information tables containing missing values. In: Proceedings of 39th International Symposium on Multiple-Valued Logic, pp. 286–291. IEEE Press (2009). https://doi.org/10.1109/ISMVL.2009.1

  4. Yang, T., Li, Q., Zhou, B.: Related family: a new method for attribute reduction of covering information systems. Inf. Sci. 228, 175–191 (2013)

    Article  MathSciNet  Google Scholar 

  5. Slowiński, R., Stefanowski, J.: Rough-set reasoning about uncertain data. Fund. Inform. 27, 229–243 (1996)

    MathSciNet  MATH  Google Scholar 

  6. Couso, I., Dubois, D.: Rough sets, coverings and incomplete information. Fund. Inform. 108(3–4), 223–347 (2011)

    MathSciNet  MATH  Google Scholar 

  7. Lin, G., Liang, J., Qian, Y.: Multigranulation rough sets: from partition to covering. Inf. Sci. 241, 101–118 (2013). https://doi.org/10.1016/j.ins.2013.03.046

    Article  MathSciNet  MATH  Google Scholar 

  8. Chen, D., Wang, C., Hu, Q.: A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets. Inf. Sci. 177, 3500–3518 (2007). https://doi.org/10.1016/j.ins.2007.02.041

    Article  MathSciNet  MATH  Google Scholar 

  9. Chen, D., Li, W., Zhang, Z., Kwong, S.: Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets. Int. J. Approximate Reasoning 55, 908–923 (2014). https://doi.org/10.1016/j.ijar.2013.10.003

    Article  MathSciNet  MATH  Google Scholar 

  10. Zhang, X., Mei, C.L., Chen, D.G., Li, J.: Multi-confidence rule acquisition oriented attribute reduction of covering decision systems via combinatorial optimization. Knowl.-Based Syst. 50, 187–197 (2013). https://doi.org/10.1016/j.knosys.2013.06.012

    Article  Google Scholar 

  11. Nakata, M., Sakai, H., Hara, K.: Rule induction based on rough sets from information tables having continuous domains. CAAI Trans. Intell. Technol. 4(4), 237–244 (2019)

    Article  Google Scholar 

  12. Nakata, M., Sakai, H., Hara, K.: Rough sets and rule induction from indiscernibility relations based on possible world semantics in incomplete information systems with continuous domains. In: Hassanien, A.E., Darwish, A. (eds.) Machine Learning and Big Data Analytics Paradigms: Analysis, Applications and Challenges. SBD, vol. 77, pp. 3–23. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-59338-4_1

    Chapter  Google Scholar 

  13. Bonikowski, Z., Bryniarski, E., Wybraniec-Skardowska, U.: Extensions and intensions in the rough set theory. Inf. Sci. 107, 149–167 (1998)

    Article  Google Scholar 

  14. Zhu, W., Wang, F.: On three types of covering-based rough sets. IEEE Trans. Knowl. Data Eng. 19(8), 1131–1144 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michinori Nakata .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 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

Nakata, M., Saito, N., Sakai, H., Fujiwara, T. (2022). Rules Induced Using Possible Coverings from Incomplete Data Sets. In: Kahraman, C., Cebi, S., Cevik Onar, S., Oztaysi, B., Tolga, A.C., Sari, I.U. (eds) Intelligent and Fuzzy Techniques for Emerging Conditions and Digital Transformation. INFUS 2021. Lecture Notes in Networks and Systems, vol 307. Springer, Cham. https://doi.org/10.1007/978-3-030-85626-7_103

Download citation

Publish with us

Policies and ethics