Minimum Weighted Mining in Frequent Directed Subgraphs
-Weigbted directed graph, being the abstract model of traffic network structure, is the hotspot of data mining research currently. This paper aims at mining weighted directed graph, two kinds of new algorithms are proposed and a connected complete subgraph could be obtained. The first algorithm WDSpan compares the value of weight on the basis of using depth-first search strategy to complete integral mining;The second algorithm called MVVD takes the product of different subgraph sizes average weights and support as a new calculation measure, the factor of weight is considered in the process of mining, and finds the minimum weight subgraphs of different models in subgraphs that meet the condition. Experimental results show that the algorithm reduces the space of memory.
graph mining weighted directed graph average weight support threshold minimum weight
Wei Ren Weixiang Xu Xiuqin Wang
State Key Laboratory of Rail Traffic Control and Safety Beijing JiaoTong University Beijing china School of Traffic and Transportation Beijing JiaoTong University Beijing China Academy of Mathematics and Systems Science, Chinese Academy of Sciences Beijing China
国际会议
西安
英文
391-395
2011-05-13（万方平台首次上网日期，不代表论文的发表时间）