计算机工程
計算機工程
계산궤공정
COMPUTER ENGINEERING
2009年
23期
47-49
,共3页
数据挖掘%数据预处理%关联规则%实时推荐
數據挖掘%數據預處理%關聯規則%實時推薦
수거알굴%수거예처리%관련규칙%실시추천
data mining%data preprocessing%association rules%real-time recommendation
针对个性化实时推荐系统的不足,提出通过构造BP树的方法压缩访问事务集.采用一个实时推荐的系统模型,将耗时的数据预处理放在离线模块,实时推荐采用动态修剪BP树的方法,穿过访问模式树的相关部分,利用网页推荐算法得到频繁访问集,生成推荐集.结果表明该算法只需扫描数据库一次,得到的频繁模式可满足页面实时推荐的快速需求.
針對箇性化實時推薦繫統的不足,提齣通過構造BP樹的方法壓縮訪問事務集.採用一箇實時推薦的繫統模型,將耗時的數據預處理放在離線模塊,實時推薦採用動態脩剪BP樹的方法,穿過訪問模式樹的相關部分,利用網頁推薦算法得到頻繁訪問集,生成推薦集.結果錶明該算法隻需掃描數據庫一次,得到的頻繁模式可滿足頁麵實時推薦的快速需求.
침대개성화실시추천계통적불족,제출통과구조BP수적방법압축방문사무집.채용일개실시추천적계통모형,장모시적수거예처리방재리선모괴,실시추천채용동태수전BP수적방법,천과방문모식수적상관부분,이용망혈추천산법득도빈번방문집,생성추천집.결과표명해산법지수소묘수거고일차,득도적빈번모식가만족혈면실시추천적쾌속수구.
Aiming at the insufficiency of personalized real-time recommendation system, this paper proposes the theory through constructing the BP tree method, and compressing visit business collection, using a Real-Time Recommendation System(RTRS) model, putting time-consuming data pre-processing module on the off-line one, recommending the use of dynamic BP tree pruning method in real-time, passing through the visit of the relevant parts of the pattern tree, obtaining the frequent visit collection by way of the homepage recommendation algorithm so as to produce recommendation collection. Result indicates that this algorithm only needs to scan the database one time, the frequent pattern obtained can meet the rapid demands of the Web page recommendation in real-time.
