基于选择偏爱度的频繁模式挖掘算法

Web技术迅速地发展,如何从庞杂的信息中获取知识已经成为人们迫切希望解决的问题之一。通过对Web日志文件的挖掘可以发现用户的频繁访问模式,找出用户的偏爱度和满意度,进行个性化服务或者帮助站点管理者进行站点的管理和结构。针对如何发现用户的频繁偏爱模式这个问题,本文综合了用户浏览时间和浏览页面的频度这两个决定因素,提出了基于选择偏爱度的使用模式挖掘算法(SPM算法),该算法在一定程度上提高了使用模式挖掘算法的覆盖率和准确率。     

基于改进的模糊聚类算法的Web日志挖掘

Web日志挖掘是Web数据挖掘领域中的一个重要研究方向,是通过对Web日志记录的挖掘发现用户访问Web页面的浏览模式用以改进Web站点的性能和组织结构。在介绍Web日志挖掘的原理和技术的基础上对Web日志挖掘中的聚类技术进行了分析研究,并重点讨论了有关模糊聚类算法的原理及计算过程,对这一算法进行了改进后的优化和应用,最后用实例对算法加以验证。     

Web访问序列模式挖掘算法的研究

针对现有Web访问序列模式挖掘算法和PrefixSpan算法存在的问题,提出一种基于投影位置的Web访问序列模式挖掘算法(PWSPM)。该算法通过序列模式分析,发现用户的行为模式,预测用户对网页的访问模式,进而改进站点的性能和组织结构,提高用户查找信息的质量和效率,以及对用户开展个性化的信息服务。实验和应用结果表明,提出的算法具有更好的执行效率,适用于Web日志挖掘,可用于构建智能化Web站点和解决个性化的信息服务问题。     

一个可以准确反映Web 浏览兴趣的度量值——偏爱度

在分析如何准确反映Web浏览兴趣的基础上提出偏爱度的概念，并依据这个概念设计了基于用户浏览偏爱树的偏爱路径挖掘算法，首先用Web日志构筑用户浏览偏爱树(PNT)；然后利用PNT树进行用户浏览兴趣模式的挖掘，发现用户浏览偏爱路径，该算法可广泛应用于电子商务领域。     

集成Web使用挖掘和内容挖掘的用户浏览兴趣迁移挖掘算法

提出了一种集成Web使用挖掘和内容挖掘的用户浏览兴趣迁移模式的模型和算法。介绍了Web页面及其聚类。通过替代用户事务中的页面为相应聚类的方法得到用户浏览兴趣序列。从用户浏览兴趣序列中得到用户浏览兴趣迁移模式。该模型对于网络管理者理解用户的行为特征和安排Web站点结构有较大的意义。     

WEB日志挖掘及其实现

Web日志中积累了大量的有用信息,从Web日志中发现有用的信息是非常必要的。该文研究了Web日志挖掘的机理,提出了通过访问路径挖掘来分析用户浏览模式的方法,并实现了一种有效的访问路径模式挖掘算法。     

一种分布式Web日志挖掘系统的设计与实现

Web挖掘已从早期的理论研究逐步转向实用阶段,可以利用对Web日志的挖掘发现用户的浏览模式、分析站点的使用情况。有效的Web日志挖掘工具是Web日志挖掘应用成功的关键。针对Web日志挖掘工具存在的问题与不足,提出了一种新颖的基于移动Agent技术的分布式Web日志挖掘系统（MAWLMS）的体系结构。重点阐述了移动代理层的设计,详细说明了移动Agent挖掘算法的设计与实现,包括最大向前路径识别算法和频繁遍历路径发现算法。最后对MAWLMS系统进行了验证,实验结果显示基于MAWLMS系统的分布式Web日志挖掘是可行且有效的。     

基于Web使用挖掘的匿名用户购买预测模型

基于Web使用挖掘的思想,通过在Web日志文件中加入用户页面动作记录,结合浏览页面和页面行为两方面的内容,设计算法计算支持度计数,进行关联规则挖掘,力图提取更加准确的用户购买模式;参照这些模式,利用一种混合模式算法对Web站点匿名访问用户的购买概率进行预测,建立预测模型,并给出了实验结果分析.提出的模型对企业的客户关系管理具有积极的意义.     

结合Web站点结构的路径补充

服务器端保存的Web访问日志含有大量的用户浏览信息,因此有效地利用该资源可以挖掘出有用的信息,并能得到用户个人的访问模式,从而为改善站点结构提供了支持。在结合站点拓扑结构的基础上,针对Web日志挖掘数据预处理过程中的路径补充提出了最短向后父节点算法(SBFN)。研究表明该算法能够对Web日志中的用户访问路径进行补充,从而为解决站点结构优化问题提供了方案。     

结合Web站点结构的路径补充

服务器端保存的Web访问日志含有大量的用户浏览信息,因此有效地利用该资源可以挖掘出有用的信息,并能得到用户个人的访问模式,从而为改善站点结构提供了支持。在结合站点拓扑结构的基础上,针对Web日志挖掘数据预处理过程中的路径补充提出了最短向后父节点算法（SBFN）。研究表明该算法能够对Web日志中的用户访问路径进行补充,从而为解决站点结构优化问题提供了方案。     

Mining top-k maximal reference sequences from streaming web click-sequences with a damped sliding window

Online mining of path traversal patterns from continuous Web click streams is one of the challenging research problems of Web usage mining. Most of previous works focus on mining path traversal patterns over the entire history of Web click streams. Mining the recent changes of Web click streams can provide valuable information for the analysis of the Web click streams. In this paper, we propose a new, online mining algorithm, called Top-DSW (top-k path traversal patterns of stream Damped Sliding Window), to discover the set of top-k path traversal patterns from streaming maximal forward references, where k is the desired number of path traversal patterns to be mined. An effective summary data structure, called TKP-DSW-list (a list of top-k path traversal patterns of stream Damped Sliding Windows) is developed to maintain the essential information about the top-k path traversal patterns from the maximal forward references within a stream damped sliding window. An effective space pruning mechanism, called TKR-list-maintain, is developed to control the memory requirement of the TKP-DSW-list. Experimental studies show that the proposed Top-DSW algorithm is an efficient, single-pass algorithm for online mining of the set of top-k path traversal patterns over stream damped sliding windows.     

Efficient algorithms for incremental Web log mining with dynamic thresholds

With the fast increase in Web activities, Web data mining has recently become an important research topic and is receiving a significant amount of interest from both academic and industrial environments. While existing methods are efficient for the mining of frequent path traversal patterns from the access information contained in a log file, these approaches are likely to over evaluate associations. Explicitly, most previous studies of mining path traversal patterns are based on the model of a uniform support threshold, where a single support threshold is used to determine frequent traversal patterns without taking into consideration such important factors as the length of a pattern, the positions of Web pages, and the importance of a particular pattern, etc. As a result, a low support threshold will lead to lots of uninteresting patterns derived whereas a high support threshold may cause some interesting patterns with lower supports to be ignored. In view of this, this paper broadens the horizon of frequent path traversal pattern mining by introducing a flexible model of mining Web traversal patterns with dynamic thresholds. Specifically, we study and apply the Markov chain model to provide the determination of support threshold of Web documents; and further, by properly employing some effective techniques devised for joining reference sequences, the proposed algorithm dynamic threshold miner (DTM) not only possesses the capability of mining with dynamic thresholds, but also significantly improves the execution efficiency as well as contributes to the incremental mining of Web traversal patterns. Performance of algorithm DTM and the extension of existing methods is comparatively analyzed with synthetic and real Web logs. It is shown that the option of algorithm DTM is very advantageous in reducing the number of unnecessary rules produced and leads to prominent performance improvement.     

用户访问兴趣路径挖掘方法

针对当前挖掘用户访问模式算法仅将频繁访问路径作为用户浏览兴趣路径的问题,依据使用Web日志挖掘用户兴趣页面时,通过引入页面信息量参数,综合考虑页面访问次数、浏览时间和页面信息量大小来定义用户兴趣度,提出了基于兴趣度的用户访问模式挖掘算法。实验证明该算法是有效的,在用户浏览兴趣度量方面比当前的频繁访问路径挖掘算法更准确。     

采用图遍历算法的服务端请求伪造漏洞检测

针对基于PHP语言开发的Web应用系统,提出了一种基于图遍历算法的服务端请求伪造漏洞检测和利用方法。通过构建抽象语法树,获取每个文件的数据流信息,进而利用数据流中的传递依赖关系构造全局的代码属性图,使用图遍历算法对生成的代码属性图进行污点分析,得到污点变量的代码传递依赖路径图,最后使用约束求解的方法对路径图中的经过函数信息进行漏洞检测并生成可利用的攻击向量。实验结果表明,这种检测方式相较于传统的静态审计方法能够很好地发现服务端请求伪造漏洞,并能够自动化生成可绕过的攻击向量。     

Mining Web navigation patterns with a path traversal graph

Understanding the navigational behaviour of website visitors is a significant factor of success in the emerging business models of electronic commerce and even mobile commerce. However, Web traversal patterns obtained by traditional Web usage mining approaches are ineffective for the content management of websites. They do not provide the big picture of the intentions of the visitors. The Web navigation patterns, termed throughout-surfing patterns (TSPs) as defined in this paper, are a superset of Web traversal patterns that effectively display the trends toward the next visited Web pages in a browsing session. TSPs are more expressive for understanding the purposes of website visitors. In this paper, we first introduce the concept of throughout-surfing patterns and then present an efficient method for mining the patterns. We propose a compact graph structure, termed a path traversal graph, to record information about the navigation paths of website visitors. The graph contains the frequent surfing paths that are required for mining TSPs. In addition, we devised a graph traverse algorithm based on the proposed graph structure to discover the TSPs. The experimental results show the proposed mining method is highly efficient to discover TSPs.     

挖掘基于Web的访问路径模式

本文介绍了一种新的基于Web的序列模式－访问路径模式挖掘问题,给出了问题的形式化描述以及挖掘访问路径模式的方法,提出了识别最大前向访问路径和发现大访问路径的算法。     

Data mining for Web intelligence

Searching, comprehending, and using the semistructured HTML, XML, and database-service-engine information stored on the Web poses a significant challenge. This data is more sophisticated and dynamic than the information commercial database systems store. To supplement keyword-based indexing, researchers have applied data mining to Web-page ranking. In this context, data mining helps Web search engines find high-quality Web pages and enhances Web click stream analysis. For the Web to reach its full potential, however, we must improve its services, make it more comprehensible, and increase its usability. As researchers continue to develop data mining techniques, the authors believe this technology will play an increasingly important role in meeting the challenges of developing the intelligent Web. Ultimately, data mining for Web intelligence will make the Web a richer, friendlier, and more intelligent resource that we can all share and explore. The paper considers how data mining holds the key to uncovering and cataloging the authoritative links, traversal patterns, and semantic structures that will bring intelligence and direction to our Web interactions.     

网页驻留时间约束的用户访问序列挖掘

对Web用户的访问序列进行分析,可以发现用户的爱好、兴趣、习惯等因素,为Web网站的升级修正提供必要的信息支持,提出一种通过对用户访问序列进行分析的数据挖掘方法,该方法采用网页驻留时间为参数来约减会话序列中的网页数,压缩频繁访问序列的规模。实验结果表明,该算法可以降低挖掘成本,为Web用户的商业数据挖掘提供有益的借鉴。     

基于多索引树的阴影光线遍历算法

阴影光线求交计算是光线跟踪的重要计算瓶颈。然而,构造一棵能有效剔除阴影 光线冗余求交计算的标准树结构仍然十分困难。为区分遮挡和非遮挡的阴影光线,提出一种基 于多索引树的遍历方法,在节点中增加提升遍历速度的索引。首先,针对遮挡光线为尽快与图 元相交的遍历特征,选择性的将位于叶节点上、对光线遮挡概率高的图元索引到中间节点,促 使光线提前在树中层停止搜索。其次,针对非遮挡光线为尽快搜索最邻近节点的遍历特征,为 底层节点建立邻接索引,减少节点搜索空间。利用帧间相关性预测遮挡类型,采用相应遍历方 法进行针对性的加速。相比专有树结构的遍历算法,该算法将遍历时效率提升 20%以上,具有 更好的遍历性能,且预计算时间更少。