细菌觅食算法与K-means结合的Web用户会话聚类  

Integration of bacterial foraging with K-means for Web user session clustering

作　　者：凌海峰[1,2] 王浩[1,2] 

机构地区：[1]合肥工业大学管理学院,合肥230009 [2]过程优化与智能决策教育部重点实验室,合肥230009

出　　处：《计算机工程与应用》2012年第36期121-124,176,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.71071047);安徽省自然科学基金(No.1208085MG120);高等学校博士学科点专项科研基金(No.20090111110016);合肥工业大学博士学位专项资助基金(No.2010HGBZ0301)

摘　　要：Web用户会话聚类是电子商务领域的NP-难问题,目的是发现相似的用户访问行为模式。该问题难度在于对大规模的Web会话进行聚类,且每个会话都表示为高维向量。提出一种细菌觅食算法和K-means相结合的优化算法,用知名的数据集测试其有效性。对Web会话进行聚类,与流行的聚类算法进行比较,实验结果显示该算法高效且性能更优。Web user session clustering is an NP-hard problem of the e-commerce field. The purpose is to discover user access patterns of behavior. The difficulty of the problem is that large-scale Web session clustering, and each session is indicated for the high-dimensional vector. This paper presents a type of clustering algorithm combining bacterial foraging algorithm with K-means algorithm, using the well-known data set to test their effectiveness, and the Web session clustering. Compared with the popular clustering algorithm, the experimental results show that the algorithm is efficient and has better performance.

关 键 词：WEB使用挖掘 细菌觅食优化 K-MEANS算法 会话聚类 电子商务 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]