Yang Dewei, Ran Jinzhi, Shen Kuo, Zhou Xingfu, Huang Bin, Zhao Weihu, Lin Chushan
{"title":"Research on filling algorithm of incomplete data in north interface of optical fiber network","authors":"Yang Dewei, Ran Jinzhi, Shen Kuo, Zhou Xingfu, Huang Bin, Zhao Weihu, Lin Chushan","doi":"10.1109/ISCTIS51085.2021.00014","DOIUrl":null,"url":null,"abstract":"Northbound interface is the interface for manufacturers or operators to access and manage the network. Through it, the superior network management can obtain a large number of data such as configuration performance and operation and maintenance of optical network. For various reasons, there are usually missing values in real data sets. In order to improve the accuracy of filling missing values. In this paper, from the perspective of data mining, we use a variety of processing methods to fill the missing value of the north interface. In this paper, by analyzing the principle of KNN algorithm, decision tree algorithm, random forest algorithm and extreme random tree algorithm, the four algorithms are simulated in the missing value processing of northbound interface data respectively. The performance differences of various algorithms are compared and analyzed, and their advantages and disadvantages are compared. Finally, the most suitable algorithm for missing value processing of northbound interface data is found. Based on the simulation and experimental results, it is concluded that the extreme random tree algorithm has better filling effect in dealing with the missing values of the north interface.","PeriodicalId":403102,"journal":{"name":"2021 International Symposium on Computer Technology and Information Science (ISCTIS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Symposium on Computer Technology and Information Science (ISCTIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCTIS51085.2021.00014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Northbound interface is the interface for manufacturers or operators to access and manage the network. Through it, the superior network management can obtain a large number of data such as configuration performance and operation and maintenance of optical network. For various reasons, there are usually missing values in real data sets. In order to improve the accuracy of filling missing values. In this paper, from the perspective of data mining, we use a variety of processing methods to fill the missing value of the north interface. In this paper, by analyzing the principle of KNN algorithm, decision tree algorithm, random forest algorithm and extreme random tree algorithm, the four algorithms are simulated in the missing value processing of northbound interface data respectively. The performance differences of various algorithms are compared and analyzed, and their advantages and disadvantages are compared. Finally, the most suitable algorithm for missing value processing of northbound interface data is found. Based on the simulation and experimental results, it is concluded that the extreme random tree algorithm has better filling effect in dealing with the missing values of the north interface.