Computer Science ›› 2014, Vol. 41 ›› Issue (3): 27-31.

Previous Articles     Next Articles

Critical Routers Detection Based on Distribution Similarity Transfer

MENG Qing-kai,ZHANG Yan,YANG Wan-qi,HU Yu-jing,SHI Ying-huan,PAN Hong-bing and WANG Hao   

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

Abstract: Critical infrastructures,which usually have large flow and key position,are common in infrastructure networks (e.g.power transmission network,Internet).The performance and reliability of the critical infrastructures directly influence the local abilities of the whole networks.To improve the ability and security-level of infrastructure networks,we proposed a novel method for critical infrastructures detection,which is mainly based on distribution similarity transfer.The aim of the proposed method is to automatically detect the critical routers in the current route.In the real application,due to several factors (e.g.network status,performance of routers),the behaviors of different routers withindifferent routes often belong to different distributions.Therefore,the proposed method models the problem as the distribution similarity transfer among different routes:First,the suspected routers are detected in the target domain (current route) by using spectral clustering;then,a newly proposed distribution similarity transfer classifier finally classifies the suspected routers obtained from the previous step.The proposed method was evaluated on the real dataset provided by Huawei Inst.The experimental results validate the proposed method can effectively detect the critical infrastructures.Meanwhile, it is demonstrated that the proposed method can successfully adopt the distribution similarity transfer to improve the classification results.

Key words: Spectral clustering,Transfer learning,Critical routers detection

[1] Ellis J,Fisher D,Longstaff T,et al.Report to the President’sCommission on Critical Infrastructure Protection[R].CARNEGIE-MELLON UNIV Pittsburgh PA Software Engineering INST,1997
[2] Fang Y,Zio E.Unsupervised spectral clustering for hierarchical modelling and criticality analysis of complex networks[J].Reliability Engineering & System Safety,2013,116:64-74
[3] Wei L,Keogh E,Xi X.SAXually explicit images:Finding unusualshapes[C]∥Sixth International Conference on Data Mining,2006.ICDM’06.IEEE,2006:711-720
[4] Xi X,Keogh E,Shelton C,et al.Fast time series classification using numerosity reduction[C]∥Proceedings of the 23rd international conference on machine learning.ACM,2006:1033-1040
[5] Wang H,Wang W,Yang J,et al.Clustering by pattern similarityin large data sets[C]∥Proceedings of the 2002ACM SIGMOD international conference on management of data.ACM,2002:394-405
[6] Kalpakis K,Gada D,Puttagunta V.Distance measures for effective clustering of ARIMA time-series[C]∥ Proceedings IEEE International Conference on Data Mining,2001.ICDM 2001.IEEE,2001:273-280
[7] Aβfalg J,Kriegel H P,Krger P,et al.Similarity search on timeseries based on threshold queries[M]∥Advances in Database Technology-EDBT 2006.Berlin Heidelberg:Springer,2006:276-294
[8] Box G E P.Time Series Analysis:Forecasting and Control[M].Wiley,2008
[9] Mrchen F.Time series feature extraction for data mining using DWT and DFT[J].2003
[10] Ji X,Li-Ling J,Sun Z.Mining gene expression data using a novel approach based on hidden Markov models[J].FEBS letters,2003,542(1):125-131
[11] Jiang J,Zhang Z,Wang H.A new segmentation algorithm to stock time series based on PIP approach[C]∥ International Conference on Wireless Communications,Networking and Mobile Computing,2007.WiCom 2007.IEEE,2007:5609-5612
[12] Pan S J,Yang Q.A survey on transfer learning[J].IEEE Tran-sactions on Knowledge and Data Engineering,2010,22(10):1345-1359
[13] Peleg S,Werman M,Rom H.A unified approach to the change of resolution:Space and gray-level[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,1989,11(7):739-742
[14] Rachev S T.The Monge-Kantorovich mass transference problemand its stochastic applications[J].Theory of Probability & Its Applications,1985,29(4):647-676
[15] Hitchcock F L.The distribution of a product from several sou-rces to numerous localities[J].J.Math.Phys.,1941,20(2):224-230
[16] Rubner Y,Tomasi C,Guibas L J.The earth mover's distance as a metric for image retrieval[J].International Journal of Compu-ter Vision,2000,40(2):99-121
[17] Pele O,Werman M.A linear time histogram metric for improved sift matching[M]∥Computer Vision-ECCV 2008.Berlin Heidelberg:Springer,2008:495-508
[18] Pele O,Werman M.Fast and robust earth mover’s distances[C]∥2009IEEE 12th International Conference on Computer vision.IEEE,2009:460-467
[19] Von Luxburg U.A tutorial on spectral clustering[J].Statistics and computing,2007,17(4):395-416
[20] Malik J,Belongie S,Leung T,et al.Contour and texture analysis for image segmentation[J].International Journal of Computer Vision,2001,43(1):7-27
[21] Hagen L,Kahng A B.New spectral methods for ratio cut partitioning and clustering[J].IEEE transactions on Computer-aided design of integrated circuits and systems,1992,11(9):1074-1085
[22] Borgwardt K M,Gretton A,Rasch M J,et al.Integrating structured biological data by kernel maximum mean discrepancy[J].Bioinformatics,2006,22(14):e49-e57

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!