.png){kind=icon}
返回
CAS based clustering algorithm for Web users
.png){kind=icon}
PRE
AI
DOI：10.1007/s11071-010-9653-2.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article devises a clustering technique for detecting groups of Web users from Web access logs. In this technique, Web users are clustered by a new clustering algorithm which uses the mechanism analysis of chaotic ant swarm (CAS). This CAS based clustering algorithm is called as CAS-C and it solves clustering problems from the perspective of chaotic optimization. The performance of CAS-C for detecting Web user clusters is compared with the popular clustering method named k-means algorithm. Clustering qualities are evaluated via calculating the average intra-cluster and inter-cluster distance. Experimental results demonstrate that CAS-C is an effective clustering technique with larger average intra-cluster distance and smaller average inter-cluster distance than k-means algorithm. The statistical analysis of resulted distances also proves that the CAS-C based Web user clustering algorithm has better stability. In order to show the utility, the proposed approach is applied to a pre-fetching task which predicts user requests with encouraging results.
Keyword:
Clustering
Chaotic ant swarm (CAS)
Web access logs
Web user clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
1.4W
被引数:
4.4W
机构
引用论文
CHAOTIC SIMULATED ANNEALING BY A NEURAL-NETWORK MODEL WITH TRANSIENT CHAOS具有瞬态混沌的神经网络模型的混沌模拟退火.png)
NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏Chaotic particle swarm optimization for economic dispatch considering the generator constraints
PREAI
分享收藏
查看更多内容