Skip to main content
SpringerLink
Log in

Describing Rough Approximations by Indiscernibility Relations in Information Tables with Incomplete Information

  • Conference paper
  • First Online:
Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 611))

Abstract

Rough approximations, a pair of lower and upper approximations, and rule induction are described by directly using indiscernibility relations in information tables containing incomplete information. A set of values is used to express incomplete information. The indiscernibility relations are constructed from viewpoints of both certainty and possibility. First, rough approximations and rule induction are described in information tables with complete information. Second, they are addressed in three cases under incomplete information. One is that a set of objects is approximated by objects with incomplete information. Another is that a set of objects with incomplete information is approximated by objects with complete information. The other is the most general case where a set of objects with incomplete information is approximated by objects with incomplete information. Consequently, we obtain four approximations: certain lower, certain upper, possible lower, and possible upper approximations. Using these approximations, rough approximations are expressed by interval sets. The rough approximations have the complementarity property linked with lower and upper approximations, as is valid under complete information. Last, rule induction are addressed in information tables with incomplete information. Rough approximations under incomplete information do not give sufficient information on rules that an object supports. This is resolved by introducing formulae dealing with pairs of an object and a rule that it supports. The pairs are classified into certain and consistent, possible and consistent, certain and inconsistent, and possible and inconsistent pairs.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Grzymała-Busse, J.W.: Data with missing attribute values: generalization of indiscernibility relation and rule induction. In: Peters, J.F., Skowron, A., Grzymała-Busse, J.W., Kostek, B., Swiniarski, R.W., Szczuka, M.S. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 78–95. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Leung, Y., Li, D.: Maximum consistent techniques for rule acquisition in incomplete information systems. Inf. Sci. 153, 85–106 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Lipski, W.: On semantics issues connected with incomplete information databases. ACM Trans. Database Syst. 4, 262–296 (1979)

    Article  Google Scholar 

  5. Lipski, W.: On databases with incomplete information. J. ACM 28, 41–70 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  6. 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)

    Google Scholar 

  7. Nakata, M., Sakai, H.: Twofold rough approximations under incomplete information. Int. J. Gen. Syst. 42, 546–571 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  8. Nakata, M., Sakai, H.: An approach based on rough sets to possibilistic information. Commun. Comput. Inf. Sci. 444, 61–70 (2014)

    Article  Google Scholar 

  9. Nakata, M., Sakai, H.: Formulating rough approximations in information tables with possibilistic information. In: Proceedings of ICGCRSIS 2015: International Conference on Granular Computing, Rough Sets and Intelligent Systems, Copenhagen, Denmark, pp. 1898–1903, 11–12 June 2015

    Google Scholar 

  10. Pawlak, Z.: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  11. Stefanowski, J., Tsoukiàs, A.: Incomplete information tables and rough classification. Comput. Intell. 17, 545–566 (2001)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Management and Information Science, Josai International University, 1 Gumyo, Togane, Chiba, 283-8555, Japan

    Michinori Nakata

  2. Department of Mathematics and Computer Aided Sciences, Faculty of Engineering, Kyushu Institute of Technology, Tobata, Kitakyushu, 804-8550, Japan

    Hiroshi Sakai

Authors
  1. Michinori Nakata
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hiroshi Sakai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Michinori Nakata .

Editor information

Editors and Affiliations

  1. INESC-ID,Instituto Superior Técnico, Universidade de Lisboa, Lisboa, Portugal

    Joao Paulo Carvalho

  2. LIP 6, Université Pierre et Marie Curie, Paris, France

    Marie-Jeanne Lesot

  3. School of Industrial Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands

    Uzay Kaymak

  4. IDMEC,Instituto Superior Técnico, Universidade de Lisboa, Lisboa, Portugal

    Susana Vieira

  5. LIP6, Université Pierre et Marie Curie, CNRS, Paris, France

    Bernadette Bouchon-Meunier

  6. Iona College, Machine Intelligence Institute, New Rochelle, New York, USA

    Ronald R. Yager

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Nakata, M., Sakai, H. (2016). Describing Rough Approximations by Indiscernibility Relations in Information Tables with Incomplete Information. In: Carvalho, J., Lesot, MJ., Kaymak, U., Vieira, S., Bouchon-Meunier, B., Yager, R. (eds) Information Processing and Management of Uncertainty in Knowledge-Based Systems. IPMU 2016. Communications in Computer and Information Science, vol 611. Springer, Cham. https://doi.org/10.1007/978-3-319-40581-0_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40581-0_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40580-3

  • Online ISBN: 978-3-319-40581-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation