%0 Journal Article
%T Minimum-redundant and Lossless Association Rule-set Representation<br>最小冗余的无损关联规则集表述
%A CHEN Yin
%A SHAN Si-Qing
%A LIU Lu
%A LI Yan
%A <br>陈茵
%A 闪四清
%A 刘鲁
%A 李岩
%J 自动化学报
%D 2008
%I 
%X There are excessive and unorderly rules produced by traditional association rule mining,many of which are redundant.It is difficult for users to understand and use.To solve this problem,the relationship between the original rule-set and the rule-set representation was discussed and a new model was represented.The new model contained an inference system established with statistics to get minimum-redundant and lossless rule-set representation by getting rid of redundant rules.This minimum-redundant and lossless rules-set representation is more concise,more intelligible,and easier to manage and use.Especially,the rule-set is lossless so that it is able to switch to the original rule-set.It is so important because the switching keeps the completeness of rule-set representation.Experiments with four data sets show that the number of rules in the rule-set representation is reduced greatly.
%K Association rules
%K redundant rules
%K rules-set representation
%K lossless<br>关联规则
%K 冗余规则
%K 规则集表述
%K 无损性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=E76622685B64B2AA896A7F777B64EB3A&aid=F38146DF75C3F83304DF831191829130&yid=67289AFF6305E306&vid=339D79302DF62549&iid=59906B3B2830C2C5&sid=4EFBE760AF9E3A64&eid=592CC3414B588215&journal_id=0254-4156&journal_name=自动化学报&referenced_num=1&reference_num=8