Using Hierarchical Classification to Exploit Context in Pattern Classification for Information Fusion
Using Hierarchical Classification to Exploit Context in Pattern Classification for Information Fusion
In data fusion applications it is important that only the minimum set of relevant features are combined at any one stage in the fusion process. A hierarchical classification methodology is described which handles features at different levels of abstraction to produce a more robust and interpretable classifier. This is achieved by dividing the classes into contextual subgroups, which are further divided to produce a tree structure defining relationships between classes. A novel approach is proposed for the class structure design which is formulated as a constrained search in the structure space. This can be performed via a forward search algorithm driven by a cost function dependent on the performance of the class structure and constraints on the required solution.
1196-1203
Bailey, Alex
cd2762de-6a67-4ffc-ab42-2842ca378fa8
Harris, Chris
c4fd3763-7b3f-4db1-9ca3-5501080f797a
July 1999
Bailey, Alex
cd2762de-6a67-4ffc-ab42-2842ca378fa8
Harris, Chris
c4fd3763-7b3f-4db1-9ca3-5501080f797a
Bailey, Alex and Harris, Chris
(1999)
Using Hierarchical Classification to Exploit Context in Pattern Classification for Information Fusion.
Proceedings of the Second International Conference on Information Fusion.
.
Record type:
Conference or Workshop Item
(Other)
Abstract
In data fusion applications it is important that only the minimum set of relevant features are combined at any one stage in the fusion process. A hierarchical classification methodology is described which handles features at different levels of abstraction to produce a more robust and interpretable classifier. This is achieved by dividing the classes into contextual subgroups, which are further divided to produce a tree structure defining relationships between classes. A novel approach is proposed for the class structure design which is formulated as a constrained search in the structure space. This can be performed via a forward search algorithm driven by a cost function dependent on the performance of the class structure and constraints on the required solution.
Other
a_bailey.ps
- Other
More information
Published date: July 1999
Venue - Dates:
Proceedings of the Second International Conference on Information Fusion, 1999-07-01
Organisations:
Southampton Wireless Group
Identifiers
Local EPrints ID: 250693
URI: http://eprints.soton.ac.uk/id/eprint/250693
PURE UUID: 5d8df757-b30a-405c-9d42-f4c82fd6e87c
Catalogue record
Date deposited: 24 Aug 1999
Last modified: 14 Mar 2024 04:54
Export record
Contributors
Author:
Alex Bailey
Author:
Chris Harris
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics