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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Attribution reduction is one of the important topics in the research on rough set theory.But the attribution reduction is a NP problem,and it needs to be realized by knowledge of elicitation method.Proposes the method that can calculate the positive region of different condition attribution combination relatively decision attribution.A new approach to compute the core attribute is also put forward in this paper.On the basic of this,the new algorithm for attribute reduction based on discernible matrix is proposed.The algorithm can get the smallest attributes quickly and be realized easily.It is realized that attribute reduction is step with rules collection.And it is proved to be workable in the practice.

A New Algorithm for Attribute Reduction Based on Discernibility Matrix