{"title":"尝试将机器学习应用于故障数据库-通信网络的案例研究","authors":"Koichi Bando, Kenji Tanaka","doi":"10.1109/PRDC.2018.00040","DOIUrl":null,"url":null,"abstract":"Progress in IT has resulted in great improvements in convenience. However, IT can cause failures that have significant negative impacts such as system failures. In order to improve these circumstances, it is important to accumulate and analyze numerous past failure cases. In order to achieve this purpose, the authors have applied machine learning to a previously accumulated failure database. We have constructed a mechanism by which to calculate the degree of similarity between documents by two methods. One method uses the appearance frequency of words, and the second method uses the appearance probability of each topic extracted from the whole document. In the present paper, focusing on communications network failures, we realized a function by which to extract past failure cases similar to inquiry inputs, as new failures. A detailed analysis and comparison of these results extracted by these two methods are presented.","PeriodicalId":409301,"journal":{"name":"2018 IEEE 23rd Pacific Rim International Symposium on Dependable Computing (PRDC)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Attempt to Apply Machine Learning to a Failure Database - A Case Study on Communications Networks\",\"authors\":\"Koichi Bando, Kenji Tanaka\",\"doi\":\"10.1109/PRDC.2018.00040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Progress in IT has resulted in great improvements in convenience. However, IT can cause failures that have significant negative impacts such as system failures. In order to improve these circumstances, it is important to accumulate and analyze numerous past failure cases. In order to achieve this purpose, the authors have applied machine learning to a previously accumulated failure database. We have constructed a mechanism by which to calculate the degree of similarity between documents by two methods. One method uses the appearance frequency of words, and the second method uses the appearance probability of each topic extracted from the whole document. In the present paper, focusing on communications network failures, we realized a function by which to extract past failure cases similar to inquiry inputs, as new failures. A detailed analysis and comparison of these results extracted by these two methods are presented.\",\"PeriodicalId\":409301,\"journal\":{\"name\":\"2018 IEEE 23rd Pacific Rim International Symposium on Dependable Computing (PRDC)\",\"volume\":\"134 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 23rd Pacific Rim International Symposium on Dependable Computing (PRDC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PRDC.2018.00040\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 23rd Pacific Rim International Symposium on Dependable Computing (PRDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRDC.2018.00040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Attempt to Apply Machine Learning to a Failure Database - A Case Study on Communications Networks
Progress in IT has resulted in great improvements in convenience. However, IT can cause failures that have significant negative impacts such as system failures. In order to improve these circumstances, it is important to accumulate and analyze numerous past failure cases. In order to achieve this purpose, the authors have applied machine learning to a previously accumulated failure database. We have constructed a mechanism by which to calculate the degree of similarity between documents by two methods. One method uses the appearance frequency of words, and the second method uses the appearance probability of each topic extracted from the whole document. In the present paper, focusing on communications network failures, we realized a function by which to extract past failure cases similar to inquiry inputs, as new failures. A detailed analysis and comparison of these results extracted by these two methods are presented.