Abstract:
In this paper, an incremental subgraph matching problem is introduced as an enhancement to a batched inexact subgraph isomorphism for situation assessment in higher level...Show MoreMetadata
Abstract:
In this paper, an incremental subgraph matching problem is introduced as an enhancement to a batched inexact subgraph isomorphism for situation assessment in higher levels of data fusion. The procedure is shown to be a bounded incremental algorithm, meaning that its runtime is a function of the size of the change in the data graph. Solution quality results are shown to be equal to that of TruST with large improvements in runtime for graphs even in the size range of thousands of nodes. This new enhancement allows subgraph isomorphism procedures to be applied to new types of fusion problems.
Published in: 2009 12th International Conference on Information Fusion
Date of Conference: 06-09 July 2009
Date Added to IEEE Xplore: 18 August 2009
Print ISBN:978-0-9824-4380-4
Conference Location: Seattle, WA, USA