一种基于深广度权重树模型的局部最优树算法  

A LOCAL OPTIMAL TREE ALGORITHM BASED ON DEPTH-WIDTH WEIGHT TREE MODEL

作　　者：蔡亮[1] 周银辉[1] 

机构地区：[1]浙江大学计算机科学与技术学院,浙江杭州310027

出　　处：《计算机应用与软件》2011年第12期269-270,300,共3页Computer Applications and Software

摘　　要：为了降低用户访问页面的点击次数,提高网站的易用性,给出了一种独特的可以表示页面导航结构的深广度权重树模型,并在不影响导航之间逻辑关系的前提下,提出一种计算权重树的局部最优树算法。通过该算法改变了网站的导航结构,降低了网站总点击次数,继而提高了网站的易用性。实验结果表明该算法是有效的。In order to reduce user page-clicks and improve website accessibility,a unique depth-width weight tree model for representing page navigation structure is presented.Without alteration of logical relations among navigations,a local optimal tree algorithm to calculate weight tree is proposed.The algorithm helps alter website navigation structure and reduce the over-all clicks,thus improving the website accessibility.Experiments have validated the algorithm.

关 键 词：网站易用性 可导航性 深广度权重树 

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