iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.1007/S00500-018-03749-8
Approximation via a double-matroid structure | Soft Computing Skip to main content
Springer Nature Link
Log in

Approximation via a double-matroid structure

  • Foundations
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Approximation is an important issue in rough set theory. In this study, we consider approximation by the matroidal approach. First, we study three lattices induced by an information system. Two of the three lattices are selected as the macrostructure and microstructure for approximation, respectively. Second, based on the two lattices, we define double-matroid lattices, where the upper and lower approximations with respect to an information system are depicted. Since the two lattices are geometric, we actually present approximation by the matroidal approach. Finally, we study the connection between our double-matroid lattices and granular partition lattices. Specifically, the comparison of these two structures is presented in both micro-level and macro-level.

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

Access this article

Log in via an institution

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

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Notes

  1. For ease in working, we denote the partition \(\{1,2\},\{3,4\}\) by (12)(34), and the partition {1,2},{3},{4} simply by its non-trivial block (12).

References

  • Bisi C, Chiaselotti G, Ciucci D, Gentile T, Infusino FG (2017) Micro and macro models of granular computing induced by the indiscernibility relation. Inf Sci 388–389:247–273

    Article  MathSciNet  Google Scholar 

  • Cattaneo G, Ciucci D (2009) Lattices with interior and closure operators and abstract approximation spaces. In: Peters JF et al (eds) Transactions on rough sets X, LNCS, vol 5656. Springer, Heidelberg, pp 67–116

    Chapter  Google Scholar 

  • Chen XY, Li QG (2007) Construction of rough approximations in fuzzy setting. Fuzzy Sets Syst 159:2641–2653

    Article  MathSciNet  MATH  Google Scholar 

  • Chiaselotti G, Ciucci D, Gentile T, Infusino FG (2016) The granular partition lattice of an information table. Inf Sci 373:57–78

    Article  MathSciNet  MATH  Google Scholar 

  • Dubois D, Prade H (1990) Rough fuzzy sets and fuzzy rough sets. Int J Gen Syst 17:191–209

    Article  MATH  Google Scholar 

  • Lee T (1987) An information-theoretic analysisof relational databases- part 1: data dependencies and metric. IEEE Trans Softw Eng SE-13 10:1049–1061

    Article  Google Scholar 

  • Li XN, Liu SY (2012) Matroidal approaches to rough sets via closure operators. Int J Approx Reason 53:513–527

    Article  MathSciNet  MATH  Google Scholar 

  • Li XN, Yi HJ, Liu SY (2016) Rough sets and matroids from a lattice-theoretic viewpoint. Inf Sci 342:37–52

    Article  MathSciNet  MATH  Google Scholar 

  • Li XN, Yi HJ, She YH, Sun BZ (2017a) Generalized three-way models based on subset-evaluation. Int J Approx Reason 83:142–159

    Article  MathSciNet  MATH  Google Scholar 

  • Li XN, Sun BZ, She YH (2017b) Generalized matroids based on three-way decision models. Int J Approx Reason 90:192–207

    Article  MathSciNet  MATH  Google Scholar 

  • Mao H (2014) Characterization and reduction of concept lattices through matroid theory. Inf Sci 281:338–354

    Article  MathSciNet  MATH  Google Scholar 

  • Marek VW, Skowron A (2014) Rough sets and matroids. In: Peters JF, Skowron A (eds) Transactions on rough sets XVII, LNCS, vol 8375, pp 74–81

  • Oxley JG (1992) Matroid theory. Oxford University Press, New York

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Pawlak Z (1991) Rough sets: theoretical aspects of reasoning about data, system theory, knowledge engineering and problem solving, vol 9. Kluwer Academic Publishers, Dordrecht

    Book  Google Scholar 

  • Skowron A (1996) Tolerance approximation spaces. Fundam Inform 27:245–253

    MathSciNet  MATH  Google Scholar 

  • Wang GY, Skowron A, Yao YY, Ślȩzak D, Polkowski L (eds) (2017) Thriving rough sets: 10th anniversary- Honoring professor Z. Pawlak’s life and legacy and 35 years of rough sets. Springer, Cham

    MATH  Google Scholar 

  • Wang SP, Zhu QX, Zhu W, Min F (2012) Matroidal structure of rough sets and its characterization to attribute reduction. Knowl-Based Syst 36:155–161

    Article  Google Scholar 

  • Wang SP, Zhu QX, Zhu W, Min F (2014) Rough set characterization for 2-circuit matroid. Fundam Inform 129:377–393

    MathSciNet  MATH  Google Scholar 

  • Welsh D (1976) Matroid theory. Academic press, London

    MATH  Google Scholar 

  • Yao YY (2004) A partition model of granular computing. In: Peters JF et al (eds) Transactions on rough sets I, LNCS, vol 3100, pp 232–253

  • Yao YY, Yao BX (2012) Covering based rough set approximations. Inf Sci 200:91–107

    Article  MathSciNet  MATH  Google Scholar 

  • Zhu W, Wang SP (2013) Rough matroids based on relations. Inf Sci 232:241–252

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors are grateful to Professor William Zhu for his help and the anonymous referees for their valuable suggestions. This work was supported by the National Natural Science Foundation of China (No. 61772019), the Shaanxi Province Natural Science Foundation Research Project (No. 2017JM1036), the Fundamental Research Funds for the Central Universities (No. JB170702) and the China Postdoctoral Science Foundation (No. 2016M602851).

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Xidian University, Xi’an, China

    Xiaonan Li

  2. School of Information and Technology, Northwest University, Xi’an, China

    Huangjian Yi

  3. School of Mathematics and Computer Science, Shanxi Normal University, Linfen, China

    Zhaohao Wang

Authors
  1. Xiaonan Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huangjian Yi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhaohao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaonan Li.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by A. Di Nola.

Dedicated to Professor Sanyang Liu on the occasion of his 60th birthday.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, X., Yi, H. & Wang, Z. Approximation via a double-matroid structure. Soft Comput 23, 7557–7568 (2019). https://doi.org/10.1007/s00500-018-03749-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-018-03749-8

Keywords

Search

Navigation