路径补全是Web日志数据预处理的重要阶段,目前的路径补全技术大多基于静态网站结构实施。个性化推荐技术的广泛应用,使站点结构由静态结构转变为动态结构。针对目前各种路径补全算法无法解决动态站点结构下用户访问路径中页面缺失的问题...路径补全是Web日志数据预处理的重要阶段,目前的路径补全技术大多基于静态网站结构实施。个性化推荐技术的广泛应用,使站点结构由静态结构转变为动态结构。针对目前各种路径补全算法无法解决动态站点结构下用户访问路径中页面缺失的问题,提出动态站点结构的概念、构造方法及站点结构的图结构存储策略。在此基础上,提出一种在动态站点结构下的基于页面类型的用户访问路径补全算法PCBPS(Path Complement Based on Page Sort)。实验证明在动态站点结构下,这种方法能较准确地恢复用户访问路径中的缺失页面,较好地提高了路径补全的准确率。展开更多
Let?G=(V,E)? be a graph. If φ is a function from the vertex set V(G) to the set of positive integers. Then two vertices?u, v ∈ V(G)? are?φ -equitable if|φ(u)-φ(v)|≤1.By the degree, equitable adjacency between ve...Let?G=(V,E)? be a graph. If φ is a function from the vertex set V(G) to the set of positive integers. Then two vertices?u, v ∈ V(G)? are?φ -equitable if|φ(u)-φ(v)|≤1.By the degree, equitable adjacency between vertices can be redefine almost all of the variants of the graphs. In this paper we study the degree equitability of the graph by defining equitable connectivity, equitable regularity, equitable connected graph and equitable complete graph. Some new families of graphs and some interesting results are obtained.展开更多
文摘路径补全是Web日志数据预处理的重要阶段,目前的路径补全技术大多基于静态网站结构实施。个性化推荐技术的广泛应用,使站点结构由静态结构转变为动态结构。针对目前各种路径补全算法无法解决动态站点结构下用户访问路径中页面缺失的问题,提出动态站点结构的概念、构造方法及站点结构的图结构存储策略。在此基础上,提出一种在动态站点结构下的基于页面类型的用户访问路径补全算法PCBPS(Path Complement Based on Page Sort)。实验证明在动态站点结构下,这种方法能较准确地恢复用户访问路径中的缺失页面,较好地提高了路径补全的准确率。
文摘Let?G=(V,E)? be a graph. If φ is a function from the vertex set V(G) to the set of positive integers. Then two vertices?u, v ∈ V(G)? are?φ -equitable if|φ(u)-φ(v)|≤1.By the degree, equitable adjacency between vertices can be redefine almost all of the variants of the graphs. In this paper we study the degree equitability of the graph by defining equitable connectivity, equitable regularity, equitable connected graph and equitable complete graph. Some new families of graphs and some interesting results are obtained.
