2019 IEEE First International Conference on Cognitive Machine Intelligence (CogMI)最新文献

筛选
英文 中文
Creating Cyber Deception Games 制作网络欺骗游戏
2019 IEEE First International Conference on Cognitive Machine Intelligence (CogMI) Pub Date : 2019-12-01 DOI: 10.1109/CogMI48466.2019.00023
M. Major, Sunny Fugate, Justin Mauger, Kimberly J. Ferguson-Walter
{"title":"Creating Cyber Deception Games","authors":"M. Major, Sunny Fugate, Justin Mauger, Kimberly J. Ferguson-Walter","doi":"10.1109/CogMI48466.2019.00023","DOIUrl":"https://doi.org/10.1109/CogMI48466.2019.00023","url":null,"abstract":"Cyber deception has typically been a tool used by attackers to mask reconnaissance activities and infiltrate networks while keeping hidden from watchful defenders. We believe the use of deception is a necessary component of network and system defense. This paper uses game theory to reason about a cyberattack scenario in which a deceiving defender uses lightweight decoys to hide and defend real hosts. In our model, a defender and an attacker play out a game with resources consisting of both real and decoy systems, a set of pre-determined actions for each player, and a method for defining and evaluating individual player strategies and payoffs. Our research provides a general framework for representing deception games using multiple game trees and an explicit representation of each individual player's knowledge of game structure and payoffs. We present a graphical representation of our multiple game tree model and a framework for representing and evaluating the strategy selection when an attacker is unaware of a subset of the defender's available strategies. Finally, we present several cyber deception scenarios using our framework.","PeriodicalId":116160,"journal":{"name":"2019 IEEE First International Conference on Cognitive Machine Intelligence (CogMI)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117110598","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Discovery of Action Rules for Continuously Valued Data 连续值数据的动作规则发现
2019 IEEE First International Conference on Cognitive Machine Intelligence (CogMI) Pub Date : 2019-12-01 DOI: 10.1109/CogMI48466.2019.00026
T. Johnsten, W. Green, Lowell Crook, R. Chan, Ryan G. Benton, David M. Bourrie
{"title":"Discovery of Action Rules for Continuously Valued Data","authors":"T. Johnsten, W. Green, Lowell Crook, R. Chan, Ryan G. Benton, David M. Bourrie","doi":"10.1109/CogMI48466.2019.00026","DOIUrl":"https://doi.org/10.1109/CogMI48466.2019.00026","url":null,"abstract":"Action rule mining develops rules that describe which attributes should be changed in order to move an object from an undesired state to a desired state, with the understanding that some attributes cannot be changed. While such rules can be very useful for end-users, a limitation in prior work is the underlying assumption that the attributes of a dataset are discrete in nature. To address this limitation, we propose a method for generating action rules for objects described by continuously valued data. As part of the process, we developed a model for determining the effectiveness of the change, which permits more tailored recommendations for how to modify objects. Experimental results indicate that we can successfully create action rules for continuous valued data, and the use of automated tuning reduces the number of changes that must be performed to move an object from an undesired state to a desired state.","PeriodicalId":116160,"journal":{"name":"2019 IEEE First International Conference on Cognitive Machine Intelligence (CogMI)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123297213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Deep Heterogeneous Social Network Alignment 深度异构社会网络对齐
2019 IEEE First International Conference on Cognitive Machine Intelligence (CogMI) Pub Date : 2019-12-01 DOI: 10.1109/CogMI48466.2019.00015
Lin Meng, Yuxiang Ren, Jiawei Zhang, Fanghua Ye, Philip S. Yu
{"title":"Deep Heterogeneous Social Network Alignment","authors":"Lin Meng, Yuxiang Ren, Jiawei Zhang, Fanghua Ye, Philip S. Yu","doi":"10.1109/CogMI48466.2019.00015","DOIUrl":"https://doi.org/10.1109/CogMI48466.2019.00015","url":null,"abstract":"The online social network alignment problem aims at inferring the anchor links connecting the shared users across social networks, which are usually subject to the one-to-one cardinality constraint. Several existing social network alignment models have been proposed, many of which are based on the supervised learning setting. Given a set of labeled anchor links, a group of features can be extracted manually for the anchor links to build these models. Meanwhile, such methods may encounter great challenges in the application on real-world social network datasets, since manual feature extraction can be extremely expensive and tedious for the social networks involving heterogeneous information. In this paper, we propose to address the heterogeneous social network alignment problem with a deep learning model, namely DETA (Deep nETwork Alignment). Besides a small number of explicit features, DETA can automatically learn a set of latent features from the heterogeneous information. DETA models the anchor link one-to-one cardinality constraint as a mathematical constraint on the node degrees. Extensive experiments have been done on real-world aligned heterogeneous social network datasets, and the experimental results have demonstrated the effectiveness of the proposed model compared against the existing state-of-the-art baseline methods.","PeriodicalId":116160,"journal":{"name":"2019 IEEE First International Conference on Cognitive Machine Intelligence (CogMI)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116983727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Improved Res2Net Model for Person re-Identification 改进的Res2Net人物再识别模型
2019 IEEE First International Conference on Cognitive Machine Intelligence (CogMI) Pub Date : 2019-10-08 DOI: 10.1109/CogMI48466.2019.00041
Zongjing Cao, H. Lee
{"title":"Improved Res2Net Model for Person re-Identification","authors":"Zongjing Cao, H. Lee","doi":"10.1109/CogMI48466.2019.00041","DOIUrl":"https://doi.org/10.1109/CogMI48466.2019.00041","url":null,"abstract":"Person re-identification has become a very popular research topic in the computer vision community owing to its numerous applications and growing importance in visual surveillance. Person re-identification remains challenging due to occlusion, illumination and significant intra-class variations across different cameras. In this paper, we propose a multi-task network base on an improved Res2Net model that simultaneously computes the identification loss and verification loss of two pedestrian images. Given a pair of pedestrian images, the system predicts the identities of the two input images and whether they belong to the same identity. In order to obtain deeper feature information of pedestrians, we propose to use the latest Res2Net model for feature extraction of each input image. Experiments on several large-scale person re-identification benchmark datasets demonstrate the accuracy of our approach. For example, rank-1 accuracies are 83.18% (+1.38) and 93.14% (+0.84) for the DukeMTMC and Market-1501 datasets, respectively. The proposed method shows encouraging improvements compared with state-of-the-art methods.","PeriodicalId":116160,"journal":{"name":"2019 IEEE First International Conference on Cognitive Machine Intelligence (CogMI)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115359273","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信