利用局部图关联信息挖掘加权频繁模式  

Mining weighted frequent patterns using local graph linking information

作　　者：耿汝年[1] 董祥军[2] 张萍[1] 须文波[1] 

机构地区：[1]江南大学信息工程学院,江苏无锡214122 [2]山东轻工业学院信息科学与技术学院,济南250353

出　　处：《计算机应用研究》2008年第9期2687-2691,共5页Application Research of Computers

基　　金：山东省优秀中青年科学家奖励基金资助项目(2006BS01017);山东省教育厅科研发展计划资助项目(J06N06);山东省自然科学基金资助项目(Y2007G25)

摘　　要：遍历模式数据挖掘方法已经在多种应用中被提出,传统的遍历模式挖掘仅仅考虑了非加权遍历。为解决加权遍历模式挖掘问题,首先提出了一种从EWDG(边加权有向图)到VWDG(顶点加权有向图)的变换模型;基于这种模型,提出了在具有层次特性的局部图遍历中,挖掘加权频繁模式的LGTWFPMiner(局部图遍历加权频繁模式挖掘法)及其支持度/权值界的局部评估方法。针对合成数据的实验结果表明该算法能够有效地进行基于图遍历的加权频繁模式挖掘。Data mining for traversal patterns has been found useful in several applications. However, traditional model of traversal patterns mining only considered unweighted traversals. This paper proposed a transformable model of EWDG （ edgeweighted directed graph） and VWDG （vertex-weighted directed graph）to resolve the problem of weighted traversal patterns mining. Based on the model ,developed a new algorithm ,called LGTWFPMiner（ local graph traversals-based weighted frequent patterns miner） , and its local estimation of support/weight-bound to discover weighted frequent patterns from the traversals on graph with a level property. Experimental results of synthetic data show the algorithm is effective to resolve the problem of mining weighted frequent patterns based on graph traversals.

关 键 词：数据挖掘 加权有向图 遍历模式 频繁模式 支持度界 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]