Computer Science ›› 2016, Vol. 43 ›› Issue (Z6): 314-318.doi: 10.11896/j.issn.1002-137X.2016.6A.075

Previous Articles     Next Articles

Link Prediction of AS Level Internet Based on Association Rule of Frequent Closed Graphs

ZHANG Yan-qing, LU Yu-liang and YANG Guo-zheng   

  • Online:2018-11-14 Published:2018-11-14

Abstract: The existing link prediction methods are mostly focused on structure link prediction like missing links,but few are about temporal link prediction according to unknown links in future,therefore a link prediction method based on association rules of frequent closed graphs was proposed.Dynamic networks are divided into training set and test test,and frequent closed subgraphs are extracted from training set based on Apriori algorithm,thus time-lag distribution matrix is built to represent the temporal association rules between frequent closed graphs,and then the structure in test set is predicted.The link prediction method was used in the dynamic networks of AS level Internet at different time scales,and experimental results show that this method can efficiently predict links in wavery dynamic networks with high precision.

Key words: Link prediction,Frequent closed graph,Temporal association,AS level Internet,Dynamic networks

[1] 傅颖斌,陈羽中.基于链路预测的微博用户关系分析[J].计算机科学,2014,41(2):201-205
[2] Zhu J,Hong J,Hughes J G.Using markov chains for link prediction in adaptive web sites[M]∥Soft-Ware 2002:Computing in an Imperfect World.Springer Berlin Heidelberg,2002:60-73
[3] O’Madadhain J,Hutchins J,Smyth P.Prediction and ranking algorithms for event-based network data[J].ACM SIGKDD Explorations Newsletter,2005,7(2):23-30
[4] Liben-Nowell D,Kleinberg J.The link-prediction problem forsocial networks[J].Journal of the American society for information science and technology,2007,58(7):1019-1031
[5] Lahiri M,Berger-Wolf T Y.Structure prediction in temporalnetworks using frequent subgraphs[C]∥IEEE Symposium on Computational Intelligence and Data Mining(CIDM 2007).IEEE,2007:35-42
[6] Clauset A,Moore C,Newman M E J.Hierarchical structure and the prediction of missing links in networks[J].Nature,2008,453(7191):98-101
[7] Yan X,Han J.CloseGraph:mining closed frequent graph pat-terns[C]∥Proceedings of the Ninth ACM SIGKDD InternationalConference on Knowledge Discovery and Data Mining.ACM,2003:286-295
[8] Inokuchi A,Washio T,Motoda H.An apriori-based algorithm for mining frequent substructures from graph data[M]∥Principles of Data Mining and Knowledge Discovery.Springer Berlin Heidelberg,2000:13-23
[9] University of Oregon Route Views project [EB/OL].http://www.routeviews.org/

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!