摘要
研究实现了一种改进的Apriori算法,通过对事务集进行扫描、删除对k-项频繁集无意义的事务,降低事务处理过程中频繁的连接次数来提高算法的效率.对图书借阅相关性挖掘的实际应用表明,随着数据量的增大,改进Apriori算法的时间效率可以提高10%以上.
This paper sets are scanned in ad realizes an improved Apriori algorithm. In order to improve the time efficiency, tra vance and irrelevant data in k-item frequent set is deleted, which can reduce a lot of nsaction connection frequency during transaction process. Data-Mining in the library related experiments shows that time efficiency of improved Apriori algorithm is improved by more than 10% along with more and more data.
出处
《常熟理工学院学报》
2010年第8期95-99,共5页
Journal of Changshu Institute of Technology
