%0 Journal Article
%A WANG Yu-rong
%A QIAN Xue-zhong
%T Level two sub sampling algorithm of mining large data sets
%D 2010
%R 10.3778/j.issn.1002-8331.2010.35.036
%J Computer Engineering and Applications
%P 126-128
%V 46
%N 35
%X For the data sets of the current association rule mining increasing，many sampling algorithm accuracy is not high and have to solve a series of NP hard problems.On the basis of using one frequent item to sample process，the association rules mining algorithm which based on the average classification of the n frequent itemsets——EHAC algorithm is presented.Theory and experiment show that EHAC can improve the accuracy of data mining，ensure the frequent itemsets can be divided average with the data be divided average，reduce the number of database scans，reduce the size of the database to a certain extent.

%U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2010.35.036