%0 Journal Article
%T Discovery of Weighted Association Rules in Databases<br>数据库中加权关联规则的发现
%A OU-YANG Wei-min
%A HENG Cheng
%A AI Qing-sheng
%A <br>欧阳为民
%A 郑诚
%A 蔡庆生
%J 软件学报
%D 2001
%I 
%X Discovery of association rules is a very hot topic in data mining research, which has been found applicable and useful in many areas. In the current researches, all the items in a databases are treated in a uniform way. However, it is not true in the real world databases, in which different items usually have different importances. In order to represent the importance of individual items, the weight value for items is introduced, and a new problem of discovery of weighted association rules is put forward. Due to the introduction of weight for items, it is not sure that any subset of a frequent itemset is also frequent. Thus, a concept of k-support bound of itemsets is set forth, and an algorithm to discover weighted association rules is proposed.
%K data mining
%K knowledge discovery
%K weighted association rule<br>数据发掘
%K 知识发现
%K 加权关联规则
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=D82D6A6345659074&yid=14E7EF987E4155E6&vid=59906B3B2830C2C5&iid=E158A972A605785F&sid=EF9E84B2DA79FF23&eid=06D504E5261AB652&journal_id=1000-9825&journal_name=软件学报&referenced_num=62&reference_num=7