关键词: 聚类算法, 相对Hamming距离, 不一致度, Web使用挖掘, 网络安全

Abstract: Concerning the clustering inaccuracy in Web usage mining, an improved clustering algorithm based on relative Hamming distance and conflicting degree was given. In this algorithm, a URL-UserID associated matrix was set up, where URL and UserID of Web site were taken as row and column respectively, and each element's value of this matrix was the user's hits. Then, similar customer groups or relevant Web pages were obtained by measuring the similarity between column vectors or between row vectors of the associated matrix. The experiments show that the new algorithm is more accurate.

Key words: clustering algorithm, relative Hamming distance, conflicting degree, Web usage mining, network security