基于相对Hamming距离的Web聚类算法  

Web clustering algorithm based on relative hamming distance

作　　者：李彬[1] 汪天飞[2] 刘才铭[1] 张建东[1] 

机构地区：[1]乐山师范学院智能信息处理及应用实验室,四川乐山614004 [2]乐山师范学院数学与信息科学学院,四川乐山614004

出　　处：《计算机应用》2011年第5期1387-1390,共4页journal of Computer Applications

基　　金：四川省教育厅基金资助项目(07ZB03110ZC106)

摘　　要：针对Web使用挖掘中聚类结果准确性不高的问题,提出了一种改进的基于相对Hamming距离和类不一致度的聚类算法。该算法首先以Web站点的URL为行、以UserID为列建立关联矩阵,元素值为用户的访问次数;然后,对所建立关联矩阵的列向量或行向量进行相似性度量,获得相似客户群体或相关页面。实验表明,该算法具有较高的准确性。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.

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

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]