Efficient Mining of Association Rules by Reducing the Number of Passes over the Database
  • 万方数据
    计算机科学技术学报(英文版) 계산궤과학기술학보(영문판)
    COMPUTER JOURNAL OF SCIENCE AND TECHNOLOGY
    2001年 2期 182-188 ,共7页

    李庆忠%王海洋%闫中敏%马绍汉

    리경충%왕해양%염중민%마소한





    This paper introduces a new algorithm of mining association rules.The algorithm RP counts the itemsets with different sizes in the same pass of scanning over the database by dividing the database into m partitions. The total number of passes over the database is only (k+2m-2)/m, where k is the longest size in the itemsets. It is much less than k.
    원문보기 원문다운로드 사이트로이동
저자의 최근 논문