首页 | 本学科首页   官方微博 | 高级检索  
     

一种新的用户事务算法
引用本文:高集荣,田艳,邵海英. 一种新的用户事务算法[J]. 计算机应用, 2009, 29(4): 1099-1101
作者姓名:高集荣  田艳  邵海英
作者单位:中山大学,信息科学与技术学院,广州,510275;西安财经学院,信息学院,西安,710061
摘    要:提出了双阈值用户事务算法。根据用户所访问的页面数来判断该用户是否为偶然用户,利用网络的拓扑结构和网页最低兴趣度来衡量一个网页是否为用户感兴趣的页面。改进了数据预处理过程,删除了偶然用户引起的访问记录,以及链接页面和用户不感兴趣的页面,生成一种有效的访问页面序列,即双阈值用户事务。通过事例对算法的有效性进行了论证。

关 键 词:数据挖掘算法  数据预处理  用户事务  双阈值
收稿时间:2008-10-17
修稿时间:2008-12-15

New user transaction algorithm
GAO Ji-rong,TIAN Yan,SHAO Hai-ying. New user transaction algorithm[J]. Journal of Computer Applications, 2009, 29(4): 1099-1101
Authors:GAO Ji-rong  TIAN Yan  SHAO Hai-ying
Affiliation:1.School of Information Science and Technology;Sun Yat-sen University;Guangzhou Guangdong 510275;China;2.School of Information;Xi'an University of Finance and Economics;Xi'an Shaanxi 710061;China
Abstract:This study proposed a user business algorithm with double thresholds. This algorithm first acted according to the page number which the user visited to judge whether this user was the accidental user, and then the network topology and homepage lowest interest degree to judge whether the homepage appealed to the users. This method improved the data pretreatment process, and deleted the visit record which the accidental user caused, as well as the link pages and the pages that users were not interested in, produced one kind of effective visiting page sequence, namely double thresholds user business. This paper has proved the validity of the algorithm through an instance.
Keywords:data mining algorithm  data preprocessing  user transaction  double thresholds
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号