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

This chapter discusses the heuristic algorithm to computes a relative reduct candidate based on evaluating classification ability of condition attributes. Considering the discernibility and equivalence of objects for condition attributes in relative reducts, we introduce evaluation criteria for condition attributes and relative reducts. The computational complexity of the proposed algorithm is \(O(|U|^2|C|^2)\). Experimental results indicate that our algorithm often generates a relative reduct producing a good evaluation result.

Heuristic Algorithm for Attribute Reduction Based on Classification Ability by Condition Attributes