Megan Hannigan, Deven McMaster, J. Llinas, Kedar Sambhoos
{"title":"数据关联和软数据流","authors":"Megan Hannigan, Deven McMaster, J. Llinas, Kedar Sambhoos","doi":"10.1109/ICIF.2010.5712079","DOIUrl":null,"url":null,"abstract":"This paper discusses the challenges of and possible methods for data association in the domain of counterinsurgency where “soft/linguistic” data is an important input data type. An overview of the processing operations from input to construction of fused estimates is described. The design issues that are discussed and require further exploration to yield a workable and efficient association process include developing an input batching logic, finding efficient ways to search between graphs, and the selection of appropriate semantic similarity metrics to associate nodes and arcs. Additionally, the solution to a multi-dimensional assignment problem and graph merging techniques will need to be defined. The application of data association in this type of environment has potential to yield an improved, comprehensive data graph which will aid in reducing search time and provide more accurate results for analysts making real time decisions in the real world.","PeriodicalId":341446,"journal":{"name":"2010 13th International Conference on Information Fusion","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Data association and soft data streams\",\"authors\":\"Megan Hannigan, Deven McMaster, J. Llinas, Kedar Sambhoos\",\"doi\":\"10.1109/ICIF.2010.5712079\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper discusses the challenges of and possible methods for data association in the domain of counterinsurgency where “soft/linguistic” data is an important input data type. An overview of the processing operations from input to construction of fused estimates is described. The design issues that are discussed and require further exploration to yield a workable and efficient association process include developing an input batching logic, finding efficient ways to search between graphs, and the selection of appropriate semantic similarity metrics to associate nodes and arcs. Additionally, the solution to a multi-dimensional assignment problem and graph merging techniques will need to be defined. The application of data association in this type of environment has potential to yield an improved, comprehensive data graph which will aid in reducing search time and provide more accurate results for analysts making real time decisions in the real world.\",\"PeriodicalId\":341446,\"journal\":{\"name\":\"2010 13th International Conference on Information Fusion\",\"volume\":\"2014 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 13th International Conference on Information Fusion\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIF.2010.5712079\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 13th International Conference on Information Fusion","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIF.2010.5712079","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper discusses the challenges of and possible methods for data association in the domain of counterinsurgency where “soft/linguistic” data is an important input data type. An overview of the processing operations from input to construction of fused estimates is described. The design issues that are discussed and require further exploration to yield a workable and efficient association process include developing an input batching logic, finding efficient ways to search between graphs, and the selection of appropriate semantic similarity metrics to associate nodes and arcs. Additionally, the solution to a multi-dimensional assignment problem and graph merging techniques will need to be defined. The application of data association in this type of environment has potential to yield an improved, comprehensive data graph which will aid in reducing search time and provide more accurate results for analysts making real time decisions in the real world.