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

Negative association rules represent some relationships between presence and absence of itemsets. In general, the number of negative association rules is enormously huge even if compared with that of positive association rules. Therefore, an efficient mining method is quite important. In this paper, we propose a novel top-down mining method for negative association rules in the forms of X ⇒¬Y and ¬X ⇒ Y . The proposed method search a suffix tree over frequent itemsets in a top-down manner, and efficiently extract all of valid negative rules of these two types, step by step. The suffix tree plays very important roles for effectively pruning a lot of redundant searches such as the one producing non-minimal valid negative rules. We also show some good results of experiments for evaluating our proposed method. The proposed method is given for simple negative rule mining based on the support and confidence measures, therefore is definitely the most fundamental and important framework, into which additional measures can be easily introduced if necessary.

負の相関ルールを抽出する高速トップダウン型アルゴリズム