作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (23): 72-75. doi: 10.3969/j.issn.1000-3428.2010.23.024

• 软件技术与数据库 • 上一篇    下一篇

基于闭合有间隔频繁子序列的点击流聚类

马超,沈微   

  1. (东北林业大学工程技术学院, 哈尔滨 150040)
  • 出版日期:2010-12-05 发布日期:2010-12-14
  • 作者简介:马超(1979-),男,讲师、硕士,主研方向:数据挖掘,物流信息技术,电子商务;沈微,讲师、博士

Clickstream Clustering Based on Closed Frequent Gapped Subsequence

MA Chao,SHEN Wei   

  1. (College of Engineering and Technology, Northeast Forestry University, Harbin 150040, China)
  • Online:2010-12-05 Published:2010-12-14

摘要: 对网站日志文件中记录的点击流序列聚类可以发现用户使用模式,从而对用户归类。而传统聚类方法面临着难以提取点击流中有代表性的特征向量以及点击流及其特征向量存在数据稀疏性的问题。针对上述情况,提出一种基于闭合有间隔频繁子序列模式挖掘的点击流聚类方法。该方法从点击流中提取子序列模式的频繁支持度,构建特征向量,利用基于双向映射欧氏距离的模糊距离度量判断向量间相似度,增强BIRCH聚类算法对点击流数据的聚类效果。

关键词: 点击流, 聚类, 频繁子序列模式, 网络使用挖掘

Abstract: Clustering of clickstreams in Weblogs can find Web visitors’ using patterns, and categorize these visitors. However, traditional clustering method faces challenge of extracting representative feature vector, sparse clickstreams and feature vector. To solve the problems, a closed repetitive gapped subsequence mining based clickstream clustering method is proposed. Extract repetitive support of subsequence from clickstream, and construct feature vector. A bidirectional projected Euclidean distance based on fuzzy dissimilarity is proposed and used as distance measure of feature vectors. Clustering quality of BIRCH algorithm on clickstream is enhanced.

Key words: clickstream, clustering, frequent subsequence pattern, Webusage mining

中图分类号: