2007Jisuanji gongchengRequires access

Minimal Association Rules and Mining Algorithm

You Wang

Open publisher page 2 citations

Abstract

Conventional mining algorithms often produce too many rules for decision makers to digest.Instead,the concept of minimal association rules is introduced from the aspect of application in this paper.Minimal rule set,which includes rules with single item as consequent and the minimal number of items as the antecedent,can be used to derive the same decisions as other association rules without information loss,while the number of minimal rules is much less than of all rules.A mining algorithm without redundant rules is proposed and the mining efficiency is improved.

About this research paper

What this paper is about

Conventional mining algorithms often produce too many rules for decision makers to digest.Instead,the concept of minimal association rules is introduced from the aspect of application in this paper.Minimal rule set,which includes rules with single item as consequent and the minimal number of items as the antecedent,can be used to derive the same decisions as other association rules without information loss,while the number of minimal rules is much less than of all rules.A mining algorithm without redundant rules is proposed and the mining efficiency is improved.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Conventional mining algorithms often produce too many rules for decision makers to digest.Instead,the concept of minimal association rules is introduced from the aspect of application in this paper.Minimal rule set,which includes rules with single item as consequent and the minimal number of items as the antecedent,can be used to derive the same decisions as other association rules without information loss,while the number of minimal rules is much less than of all rules.A mining algorithm without redundant rules is proposed and the mining efficiency is improved.

Key concepts: Association rule learning, Computer science, Antecedent (behavioral psychology), Data mining, Set (abstract data type), Efficient algorithm, Algorithm, Decision rule

Related papers

Back to paper searchBrowse research topicsOriginal source
Minimal Association Rules and Mining Algorithm — Research Paper | ScholarLens