Joshi Kumar A.V., A. Bharathi, Vinoth Kumar, Trillia Ku, B. N.S.
{"title":"Rival Check Cross Correlator for locating strategic defense base using supervised learning","authors":"Joshi Kumar A.V., A. Bharathi, Vinoth Kumar, Trillia Ku, B. N.S.","doi":"10.1109/ICCCT2.2017.7972311","DOIUrl":null,"url":null,"abstract":"The need of machine learning in the defence planning and strategies is increasing day by day due to the increasing amount of breaches and decimations caused by terrorist forces. A myriad of military bases, temporary campaigns, base camps etc. are being targeted and attacked by several terrorist forces. The common problem in the warfare and tumultuous international borders is the frequent and violent intrusion and breaches upon the temporary / permanent military and army bases. Though they are successful in their individual task to identify the safest or the effective base, a combined location that embraces both effectiveness and vulnerability is invalid using a present analyzing and classification technology. This problem is due to the presence of collinearity between the parameters that determine both effectiveness and vulnerability. A military base location can be both effective and vulnerable at the same time, a location that does not provide sufficient effectiveness to perform military operation. To combat this problem, in this paper we propose an algorithm that identifies the two rival parameters (effectiveness and vulnerability) and cross correlates them one by one for checking collinearity between them. Additionally, after identifying the collinear combinations, the Rival Check Cross Correlation Algorithm eliminates those collinear combinations, thereby providing unambiguous combinations of effective variables.","PeriodicalId":445567,"journal":{"name":"2017 2nd International Conference on Computing and Communications Technologies (ICCCT)","volume":"32 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 2nd International Conference on Computing and Communications Technologies (ICCCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCT2.2017.7972311","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The need of machine learning in the defence planning and strategies is increasing day by day due to the increasing amount of breaches and decimations caused by terrorist forces. A myriad of military bases, temporary campaigns, base camps etc. are being targeted and attacked by several terrorist forces. The common problem in the warfare and tumultuous international borders is the frequent and violent intrusion and breaches upon the temporary / permanent military and army bases. Though they are successful in their individual task to identify the safest or the effective base, a combined location that embraces both effectiveness and vulnerability is invalid using a present analyzing and classification technology. This problem is due to the presence of collinearity between the parameters that determine both effectiveness and vulnerability. A military base location can be both effective and vulnerable at the same time, a location that does not provide sufficient effectiveness to perform military operation. To combat this problem, in this paper we propose an algorithm that identifies the two rival parameters (effectiveness and vulnerability) and cross correlates them one by one for checking collinearity between them. Additionally, after identifying the collinear combinations, the Rival Check Cross Correlation Algorithm eliminates those collinear combinations, thereby providing unambiguous combinations of effective variables.