摘要
不同时刻的动态网络往往具有不同权重,针对加权动态网络的频繁模式挖掘,提出一种挖掘算法WGDM,它适用于加权动态社会网络、生物网络等方面的频繁模式挖掘。WGDM算法利用支持度的反单调性裁剪搜索空间,从而减少冗余候选子图,提高算法效率。通过实验测试了WGDM算法的性能,并根据中国实际股票市场网络,利用WGDM算法挖掘股票市场网络中有趣的频繁模式。
The dynamic network often has different weights at different times. In order to mining the frequent pattern from the weighted dynamic network, this paper presents a mining frequent subgraph algorithm WGDM bases on weighted graph datasets. It can be applied to mining weighted dynamic network, biology network and so on. Algorithm WGDM utilizes the decrease monotony of support to reduce the search space and the number of candidate subgraph. And make a test for the algorithm WGDM. Finally use the algorithm WGDM for mining the interesting frequent pattern from the Chinese stock market network.
出处
《微型机与应用》
2011年第19期7-10,共4页
Microcomputer & Its Applications
基金
国家自然科学基金(No.61070020)
福建省新世纪优秀人才项目(XSJRC2007-11)
关键词
加权动态网络
加权图集
频繁子图
图挖掘
weighted dynamic network
weighted graph datasets
frequent subgraph
graph mining
