Clustering web users based on the accessing time and Web site's hierarchy

摘要

With the rapid development of Web site, it becomes more and more important for Web master to cluster Web users. By clustering Web user, we can analyze user's interest and know what is user's need so that provide them better personal service. At the same time, we are able to optimize the Web site's hierarchy and attract more and more users. This paper presents a new clustering algorithm, which is based on the accessing time and the Web site's hierarchy. Experiments show this algorithm has a better performance compared to traditional algorithms, which are based on only whether or not users have accessed the Web site, or only accessing time.