| 基于相对Hamming距离的Web聚类算法 |
| |
| 引用本文： | 李彬,汪天飞,刘才铭,张建东.基于相对Hamming距离的Web聚类算法[J].计算机应用,2011,31(5):1387-1390. |
| |
| 作者姓名： | 李彬 汪天飞 刘才铭 张建东 |
| |
| 作者单位： | 1.乐山师范学院 智能信息处理及应用实验室,四川 乐山 614004
2.乐山师范学院 数学与信息科学学院,四川 乐山 614004 |
| |
| 摘 要： | 针对Web使用挖掘中聚类结果准确性不高的问题,提出了一种改进的基于相对Hamming距离和类不一致度的聚类算法。该算法首先以Web站点的URL为行、以UserID为列建立关联矩阵,元素值为用户的访问次数;然后,对所建立关联矩阵的列向量或行向量进行相似性度量,获得相似客户群体或相关页面。实验表明,该算法具有较高的准确性。
|
| 关 键 词： | 聚类算法 相对Hamming距离 不一致度 Web使用挖掘 网络安全 |
| 收稿时间： | 2010-11-02 |
| 修稿时间： | 2011-01-10 |
Web clustering algorithm based on relative hamming distance |
| |
| LI Bin,WANG Tian-fei,LIU Cai-ming,ZHANG Jian-dong.Web clustering algorithm based on relative hamming distance[J].journal of Computer Applications,2011,31(5):1387-1390. |
| |
| Authors: | LI Bin WANG Tian-fei LIU Cai-ming ZHANG Jian-dong |
| |
| Affiliation: | 1.Laboratory of Intelligent Information Processing and Application, Leshan Normal University, Leshan Sichuan 614004, China
2. College of Mathematics and Information Science, Leshan Normal University, Leshan Sichuan 614004, China |
| |
| 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. |
| |
| Keywords: | clustering algorithm relative Hamming distance conflicting degree Web usage mining network security |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
|
