Web使用挖掘中Apriori算法的改进研究
Web사용알굴중Apriori산법적개진연구
Improvement research of Apriori algorithm on web using mining
  • 万方数据
    计算机工程与设计 계산궤공정여설계
    COMPUTER ENGINEERING AND DESIGN
    2010年 3期 539-541,563 ,共4页

    许晓东%李柯%朱士瑞

    허효동%리가%주사서

    Web挖掘%不规则数组%项集有序性%二进制%访问模式 Web挖掘%不規則數組%項集有序性%二進製%訪問模式
    Web알굴%불규칙수조%항집유서성%이진제%방문모식
    web mining%ragged array%ordering of itemset%binary%access pattern
    分析了挖掘频繁访问模式的过程和当前Apriori算法的缺陷,提出了一种Apriori算法的改进算法:BI_Apriori算法.改进的算法采用不规则数组来保存项集信息,有效省去了扫描数据库所耗费的大量时间.将项集有序性引入到该数组上,减少了候选项集的个数.并采用二进制来表示1阶频繁访问模式,提高了模式匹配和连接的效率.试验结果表明,该改进算法能更有效地发现各种长度不同的访问模式.
    분석료알굴빈번방문모식적과정화당전Apriori산법적결함,제출료일충Apriori산법적개진산법:BI_Apriori산법.개진적산법채용불규칙수조래보존항집신식,유효성거료소묘수거고소모비적대량시간.장항집유서성인입도해수조상,감소료후선항집적개수.병채용이진제래표시1계빈번방문모식,제고료모식필배화련접적효솔.시험결과표명,해개진산법능경유효지발현각충장도불동적방문모식.
    The process of discovering user frequent access pattern and the defect of Apriori algorithm are analyzed,and a improved algorithm called.BI_Apriori algorithm is proposed.The ragged array is used to store itemset information and reduce a mass of time by scanning database.The ordering of itemset is used to the array and reduce the number of candidate itemset.And the one frequent pattern is expressed by Binary,so the efficiency of pattern matching and connecting is improved.The experimental result show that the improved algorithm discover user access patterns of different lengths more effectively.
    원문보기 원문다운로드 사이트로이동
저자의 최근 논문