Skip to main content

Matrix-Based Rough Set Approach for Dynamic Probabilistic Set-Valued Information Systems

  • Conference paper
  • First Online:
  • 972 Accesses

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

Abstract

Set-valued information systems (SvIS), in which the attribute values are set-valued, are important types of data representation with uncertain and missing information. However, all previous investigations in rough set community do not consider the attribute values with probability distribution in SvIS, which may be impractical in many real applications. This paper introduces probabilistic set-valued information systems (PSvIS) and presents an extended variable precision rough sets (VPRS) approach based on \(\lambda \)-tolerance relation for PSvIS. Furthermore, due to the dynamic variation of attributes in PSvIS, viz., the addition and deletion of attributes, we present a matrix characterization of the proposed VPRS model and discuss some related properties. Then incremental approaches for maintaining rough approximations based on matrix operations are presented, which can effectively accelerate the updating of rough approximations in dynamic PSvIS.

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

Buying options

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 EPUB and 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

Learn about institutional subscriptions

References

  1. Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11, 341–356 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  2. Maji, P.: A rough hypercuboid approach for feature selection in approximation spaces. IEEE Trans. Knowl. Data Eng. 26, 16–29 (2014)

    Article  Google Scholar 

  3. Kotlowski, W., Slowinski, R.: On nonparametric ordinal classification with monotonicity constraints. IEEE Trans. Knowl. Data Eng. 25, 2576–2589 (2013)

    Article  Google Scholar 

  4. Yao, Y.: Rough sets and three-way decisions. In: Ciucci, D., Wang, G., Mitra, S., Wu, W.-Z. (eds.) RSKT 2015. LNCS (LNAI), vol. 9436, pp. 62–73. Springer, Heidelberg (2015). doi:10.1007/978-3-319-25754-9_6

    Chapter  Google Scholar 

  5. Guan, Y.Y., Wang, H.K.: Set-valued information systems. Inf. Sci. 176, 2507–2525 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Qian, Y.H., Dang, C.Y., Liang, J.Y., Tang, D.W.: Set-valued ordered information systems. Inf. Sci. 179, 2809–2832 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ziarko, W.: Variable precision rough set model. J. Comput. Syst. Sci. 46, 39–59 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  8. Li, T.R., Ruan, D., Geert, W., Song, J., Xu, Y.: A rough sets based characteristic relation approach for dynamic attribute generalization in data mining. Knowl. Based Syst. 20, 485–494 (2007)

    Article  Google Scholar 

  9. Liang, J.Y., Wang, F., Dang, C.Y., Qian, Y.H.: A group incremental approach to feature selection applying rough set technique. IEEE Trans. Knowl. Data Eng. 26, 294–308 (2014)

    Article  Google Scholar 

  10. Yang, X.B., Qi, Y., Yu, H.L., Song, X.N., Yang, J.Y.: Updating multigranulation rough approximations with increasing of granular structures. Knowl. Based Syst. 64, 59–69 (2014)

    Article  Google Scholar 

  11. Luo, C., Li, T.R., Chen, H.M., Lu, L.X.: Fast algorithms for computing rough approximations in set-valued decision systems while updating criteria values. Inf. Sci. 299, 221–242 (2015)

    Article  MathSciNet  Google Scholar 

  12. Zhang, J.B., Li, T.R., Ruan, D., Liu, D.: Rough sets based matrix approaches with dynamic attribute variation in set-valued information systems. Int. J. Approximate Reasoning 53, 620–635 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  13. Wang, S.P., Zhu, W., Zhu, Q.X., Min, F.: Characteristic matrix of covering and its application to boolean matrix decomposition. Inf. Sci. 263, 186–197 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  14. Huang, Y., Li, T., Horng, S.: Dynamic maintenance of rough fuzzy approximations with the variation of objects and attributes. In: Yao, Y., Hu, Q., Yu, H., Grzymala-Busse, J.W. (eds.) RSFDGrC 2015. LNCS (LNAI), vol. 9437, pp. 173–184. Springer, Heidelberg (2015). doi:10.1007/978-3-319-25783-9_16

    Chapter  Google Scholar 

  15. Kailath, T.: The divergence and bhattacharyya distance measures in signal selection. IEEE Trans. Commun. Technol. 15, 52–60 (1967)

    Article  Google Scholar 

Download references

Acknowledgements

This work is supported by the National Science Foundation of China (Nos. 61573292, 61572406).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tianrui Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Huang, Y., Li, T., Luo, C., Horng, Sj. (2016). Matrix-Based Rough Set Approach for Dynamic Probabilistic Set-Valued Information Systems. In: Flores, V., et al. Rough Sets. IJCRS 2016. Lecture Notes in Computer Science(), vol 9920. Springer, Cham. https://doi.org/10.1007/978-3-319-47160-0_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-47160-0_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-47159-4

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics