关键词: Web日志挖掘, 交集关系, 频繁访问模式

Abstract: Mining frequent access patterns is an important task of Web log mining.In connection with the shortage of the similar Apriori algorithm and the GITC algorithm，the paper presents BIPL algorithm which is used to mine the Web frequent access patterns.The algorithm is based on parents list and intersection，and requests to scan the database only one times.It first gets the intersections of each two access patterns and gives the birth to candidate access patterns.And the parents access patterns of each candidate access pattern are saved in the process of intersection.Then the counts of all the candidate access patterns can be calculated easily through add operational.Finally，the algorithm is proved to be stable and efficient through theoretical analysis and experimental proof.

Key words: Web log mining, intersection relation, frequent access pattern