Skip to main content
SpringerLink
Log in

Some invariant properties of ordered information systems under homomorphism

  • Research Papers
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

In this paper, some properties of ordered information systems under homomorphism are investigated. The concept of a consistent function with respect to dominance relations is first introduced and its properties are investigated. Then, some main invariant properties of dominance relations under relation mappings are studied. It is proven that attribute reductions in the original ordered information system and its image system are equivalent under the condition of homomorphism. By means of the results, we can get the smaller image system that has the same reducts as a given massive ordered information system.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Dick S, Schenker A, Pedrycz W, et al. Regranulation: A granular algorithm enabling communication between granular worlds. Inf Sci, 2007, 177: 408–435

    Article  MATH  MathSciNet  Google Scholar 

  2. Pedrycz W, Vukovich G. Granular worlds: Representation and communication problems. Int J Intell Syst, 2000, 15: 1015–1026

    Article  MATH  Google Scholar 

  3. Pedrycz W, Bezdek J C, Hathaway R J, et al. Two nonparametric models for fusing heterogeneous fuzzy data. IEEE Trans Fuzzy Syst, 1998, 6: 411–425

    Article  Google Scholar 

  4. Wang C Z, Wu C X, Chen D G, et al. Communicating between Information systems. Inf Sci, 2008, 178: 3228–3239

    Article  MATH  MathSciNet  Google Scholar 

  5. Grzymala-Busse J W. Algebraic properties of knowledge representation systems. In: Ras Z W, Zemankova M, eds. Proceedings of the ACM SIGART International Symposium on Methodologies for Intelligent Systems. New York: ACM, 1986. 432–440

    Chapter  Google Scholar 

  6. Grzymala-Busse J W, Sedelow J. On rough sets, and information system homomorphism. Bull Pol Acad Sci Tech Sci, 1988, 36(3): 233–239

    MATH  Google Scholar 

  7. Li D Y, Ma Y C. Invariant characers of information systems under some homomorphisms. Inf Sci, 2000, 129: 211–220

    Article  MATH  MathSciNet  Google Scholar 

  8. Wang C Z, Wu C X, Chen D G, et al. Some properties of relation information systems under homomorphisms. Appl Math Lett, 2008, 21: 940–945

    Article  MATH  MathSciNet  Google Scholar 

  9. Wang C Z, Chen D G, Zhu L K. Homomorphism between fuzzy information systems. Appl Math Lett, 2009, 22: 1045–1050

    Article  MATH  MathSciNet  Google Scholar 

  10. Greco S, Matarazzo B, Slowinski R. Rough sets theory for multicriteria decision analysis. Europ J Oper Res, 2001, 129: 11–47

    Article  MathSciNet  Google Scholar 

  11. Greco S, Matarazzo B, Slowinski R. Rough sets methodology for sorting problems in presence of multiple attributes and criteria. Europ J Oper Res, 2002, 138: 247–259

    Article  MATH  MathSciNet  Google Scholar 

  12. Hu Q H, Yu D R, Xie Z X. Information-preserving hybrid data reduction based on fuzzy-rough techniques. Patt Recog Lett, 2006, 27: 414–423

    Article  Google Scholar 

  13. Qian Y H, Dang C Y, Liang J Y, et al. Set-valued ordered information systems. Inf Sci, 2009, 179: 2809–2832

    Article  MATH  MathSciNet  Google Scholar 

  14. Shao M W, Zhang W X. Dominance relation and rules in an incomplete ordered information system. Int J Intell Syst, 2005, 20: 13–27

    Article  MATH  Google Scholar 

  15. Wang X Z, Tsang E C C, Zhao S Y, et al. Learning fuzzy rules from fuzzy samples based on rough set technique. Inf Sci, 2007, 177: 4493–4514

    Article  MATH  MathSciNet  Google Scholar 

  16. Hu Q Q, Wang G J. A novel algorithm for explicit optimal multi-degree reduction of triangular surfaces. Sci China Ser F-Inf Sci, 2008, 51: 13–24

    Article  MATH  MathSciNet  Google Scholar 

  17. Liang J Y, Qian Y H. Information granules and entropy theory in information systems. Sci China Ser F-Inf Sci, 2008, 51: 1445–1465

    Article  MathSciNet  Google Scholar 

  18. Wei L, Qi J J, Zhang W X. Attribute reduction theory of concept lattice based on decision formal contexts. Sci China Ser F-Inf Sci, 2008, 51: 910–923

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  20. Lin T Y. Neighborhood systems and relational database. In: Proceedings of 1988 ACM Sixteenth Annual Computer Science Conference. New York: ACM, 1988. 23–25

    Google Scholar 

  21. Skowron A, Stepaniuk J. Tolerance approximation spaces. Fundam Inform, 1996, 27: 245–253

    MATH  MathSciNet  Google Scholar 

  22. Slowinski R, Vanderpooten D. A generalized definition of rough approximations based on similarity. IEEE Trans Knowl Data Eng, 2000, 12: 331–336

    Article  Google Scholar 

  23. Yao Y Y. Relational interpretations of neighborhood operators and rough set approximation operators. Inf Sci, 1998, 111: 239–259

    Article  MATH  Google Scholar 

  24. Yeung D S, Chen D G, Tsang E C, et al. On the generalization of fuzzy rough sets. IEEE Trans Fuzzy Syst, 2005, 13: 343–361

    Article  Google Scholar 

  25. Zhu W. Generalized rough sets based on relations. Inf Sci, 2007, 177: 4997–5011

    Article  MATH  Google Scholar 

  26. Wang C Z, Wu C X, Chen D G. A systematic study on attribute reduction with rough sets based on general dominance relations. Inf Sci, 2008, 178: 2237–2261

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  28. Bryson N, Mobolurin A. An action learning evaluation procedure for multiple criteria decision making problems. Europ J Oper Res, 1996, 96: 379–386

    Article  Google Scholar 

  29. Iyer N S. A family of dominance rules for multi-attribute decision-making under uncertainty. IEEE Trans Syst Man Cybern A, 2003, 33: 441–450

    Article  Google Scholar 

  30. Qian Y H, Liang J Y, Dong C Y. Interval ordered information systems. Comput Math Appl, 2008, 56: 1994–2009

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Bohai University, Jinzhou, 121000, China

    ChangZhong Wang

  2. Department of Mathematics and Physics, North China Electric Power University, Beijing, 102206, China

    DeGang Chen

  3. Power Engineering, Harbin Institute of Technology, Harbin, 150001, China

    QingHua Hu

Authors
  1. ChangZhong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. DeGang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. QingHua Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to ChangZhong Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, C., Chen, D. & Hu, Q. Some invariant properties of ordered information systems under homomorphism. Sci. China Inf. Sci. 53, 1816–1825 (2010). https://doi.org/10.1007/s11432-010-4044-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-010-4044-3

Keywords

Search

Navigation