%0 Journal Article
%T An Efficient Algorithm for Discovering Association Rules Based on Vertical Data Layout<br>基于垂直数据分布的关联规则高效发现算法
%A OU-YANG Wei-min
%A CAI Qing-sheng
%A <br>欧阳为民
%A 蔡庆生
%J 软件学报
%D 1999
%I 
%X In this paper, the authors analyze the methods to generate and test frequent itemsets in existing algorithms in KDD research, and put forward a new efficient algorithm for discovering association rules based on vertical data layout. This algorithm has no need of Hash data structure and makes only two databases scans. As a result, the algorithm not only facilitates the implementation, but also improves the efficiency.
%K Association rule
%K frequent itemsets
%K equivalence class<br>关联规则
%K 频繁项目集
%K 等价类.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=F13398E76295003F&yid=B914830F5B1D1078&vid=F3090AE9B60B7ED1&iid=DF92D298D3FF1E6E&sid=9409F3EB075DCD5B&eid=8D71AF42ACD39979&journal_id=1000-9825&journal_name=软件学报&referenced_num=14&reference_num=7