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

摘要

为了降低用户访问页面的点击次数,提高网站的易用性,给出了一种独特的可以表示页面导航结构的深广度权重树模型,并在不影响导航之间逻辑关系的前提下,提出一种计算权重树的局部最优树算法.通过该算法改变了网站的导航结构,降低了网站总点击次数,继而提高了网站的易用性.实验结果表明该算法是有效的.%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.