Rival Check Cross Correlator for locating strategic defense base using supervised learning

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.
利用监督学习定位战略防御基地的对手检查交叉相关器
由于恐怖主义力量造成的破坏和伤亡数量日益增加,国防规划和战略中对机器学习的需求日益增加。无数的军事基地、临时战役、基地营地等都成为恐怖主义势力的目标和袭击。战争和动荡的国际边界的共同问题是对临时/永久军事和陆军基地的频繁和暴力入侵和破坏。尽管他们在各自的任务中成功地确定了最安全或有效的基地,但使用现有的分析和分类技术,包含有效性和脆弱性的组合位置是无效的。这个问题是由于决定有效性和脆弱性的参数之间存在共线性。一个军事基地的位置可以同时是有效的和脆弱的,一个位置不能提供足够的效力来执行军事行动。为了解决这一问题,本文提出了一种识别两个敌对参数(有效性和脆弱性)并逐一交叉相关以检查它们之间共线性的算法。此外,在识别出共线组合后,Rival Check相互关联算法消除了这些共线组合,从而提供了有效变量的明确组合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信