%0 Journal Article
%T Frequent Item Sets Mining Algorithms<br>频繁项集挖掘算法
%A YAN Yue-Jin LI Zhou-Jun CHEN Huo-Wang
%A <br>颜跃进
%A 李舟军
%A 陈火旺
%J 计算机科学
%D 2004
%I 
%X Nowadays dat mining is becoming one of most popular problems in the field of database research, Mining frequent item sets in a key step in many data mining problems, such as association rule mining, sequential pattern mining,and so on. In this paper,we introduce the characteristic of frequent item sets mining problems,and then we analyze and compare today's common approaches according to search strategy.
%K Frequent item sets
%K Apriori property
%K Support
%K Breath-first search
%K Depth-first search<br>数据库
%K 频繁项集
%K 数据挖掘算法
%K 关联规则
%K 数据库管理系统
%K 计算机
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=BAAE0A588A504F4C&yid=D0E58B75BFD8E51C&vid=4AD960B5AD2D111A&iid=38B194292C032A66&sid=4BB057F167CF3A60&eid=DDD31293A7C7D057&journal_id=1002-137X&journal_name=计算机科学&referenced_num=15&reference_num=27