Skip to main content
SpringerLink
Log in
Book cover

International Conference on Rough Sets and Knowledge Technology

RSKT 2010: Rough Set and Knowledge Technology pp 143–150Cite as

A Heuristic Reduction Algorithm in IIS Based on Binary Matrix

  • Conference paper

  • 936 Accesses

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

Abstract

A binary discernibility matrix is presented in this paper, upon which a binary matrix-based heuristic reduction algorithm in incomplete information system(IIS) is proposed. In the proposed algorithm, the problem of finding an attribute reduction is converted to the problem of searching a set of binary matrices that can cover the objective binary matrix. The heuristic function in the proposed heuristic reduction algorithm is defined by a discernibility matrix associated with each condition attribute, which denotes the classification significance of the condition attribute. In the proposed heuristic reduction algorithm, attribute reduct is constructed by adding attributes in the sequence of attribute significance. An example of incomplete information system is presented to illustrate the algorithm and its validity.The algorithm is proved to be effective based on an illustrative example.

This is a preview of subscription content, 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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hu, X.H., Cercone, N.: Learning in relational databases: a rough set approach. Computational Intelligence 11, 323–338 (1995)

    Article  Google Scholar 

  2. Kryszkiewicz, M.: Rough Set Approach to Incomplete Information Systems. Information Sciences 112, 39–49 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Kryszkiewicz, M.: Rules in Incomplete Information Systems. Information Sciences 113, 271–292 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Li, H.X., Zhou, X.Z., Huang, B.: Method to determine α in rough set model based on connection degree. Journal of Systems Engineering and Electronics 20(1), 98–105 (2009)

    Google Scholar 

  5. Miao, D.Q., Hu, G.R.: A heuristic algorithm for reduction of knowledge. Journal of Computer Research and Development 36(6), 681–684 (1999) (in Chinese)

    Google Scholar 

  6. Pawlak, Z.: Rough sets. International Journal of Computer and Information Science 11, 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  7. Pawlak, Z.: Rough classification. International Journal of Man-Machine Studies 20, 469–483 (1984)

    Article  MATH  Google Scholar 

  8. Pawlak, Z., Skowron, A.: Rudiments of rough sets. Information Sciences 177(1), 3–27 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  9. Skowron, A., Rauszer, C.: The discernibility matrices andfunctions in information systems. In: Slowiski, R. (ed.) Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory, pp. 331–362. Kluwer, Dordrecht (1992)

    Google Scholar 

  10. Stefamowski, J., Tsoukeas, A.: On the Extension of Rough Sets under Incomplete Information. International Journal of Intelligent System 16, 29–38 (1999)

    Google Scholar 

  11. Wang, G.Y.: Calculation methods for core attributes of decision table. Chinese Journal of Computers 26(5), 611–615 (2003)

    Google Scholar 

  12. Wang, G.Y.: Extension of rough set under incomplete information systems. Journal of computer research and development 39(10), 1238–1243 (2002) (in Chinese)

    Google Scholar 

  13. Xu, Z.Y., Liu, Z.P., Yang, B.R., et al.: A quick attribute reduction algorithm with complexity of max(O(|C||U|),O(|C|2|U/C|)). Chinese Journal of Computers 29(3), 391–399 (2006)

    MathSciNet  Google Scholar 

  14. Yang, M.: An incremental updating algorithm for attribute reduction based on improved discernibility matrix. Chinese Journal of Computers 29(3), 407–413 (2006)

    Google Scholar 

  15. Yao, Y.Y., Zhao, Y.: Discernibility matrix simplification for constructing attribute reducts. Information Sciences 179(5), 867–882 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  16. Ye, D.Y., Chen, Z.J.: A new discernibility matrix and the computation of a core. Acta Electronica Sinica 30(7), 1086–1088 (2002) (in Chinese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Management and Engineering, Nanjing University, Nanjing, Jiangsu, 210093, P.R. China

    Huaxiong Li, Xianzhong Zhou & Meimei Zhu

  2. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, 210093, P.R. China

    Huaxiong Li & Xianzhong Zhou

Authors
  1. Huaxiong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xianzhong Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Meimei Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer and Information Technology, Beijing Jiaotong University, 100044, Beijing, China

    Jian Yu

  2. Faculty of Economics, University of Catania, Corso Italia, 55, 95129, Catania, Italy

    Salvatore Greco

  3. Department of Mathematics and Computing Science, Saint Mary’s University, B3H 3C3, Halifax, Nova Scotia, Canada

    Pawan Lingras

  4. Institute of Computer Science and Technology, Chongqing University of Posts and Telecommunications, 400065, Chongqing, China

    Guoyin Wang

  5. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, H., Zhou, X., Zhu, M. (2010). A Heuristic Reduction Algorithm in IIS Based on Binary Matrix. In: Yu, J., Greco, S., Lingras, P., Wang, G., Skowron, A. (eds) Rough Set and Knowledge Technology. RSKT 2010. Lecture Notes in Computer Science(), vol 6401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16248-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16248-0_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16247-3

  • Online ISBN: 978-3-642-16248-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation