English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Attribute reduction is a basic issue in knowledge representation and datamining. Rough sets provide a theoretical foundation for the issue. Matroidsgeneralized from matrices have been widely used in many fields, particularlygreedy algorithm design, which plays an important role in attribute reduction.Therefore, it is meaningful to combine matroids with rough sets to solve theoptimization problems. In this paper, we introduce an existing algebraicstructure called dependence space to study the reduction problem in terms ofmatroids. First, a dependence space of matroids is constructed. Second, thecharacterizations for the space such as consistent sets and reducts are studiedthrough matroids. Finally, we investigate matroids by the means of the spaceand present two expressions for their bases. In a word, this paper provides newapproaches to study attribute reduction.

Dependence space of matroids and its application to attribute reduction