Published:
May 1998
Proceedings:
Proceedings of the Eleventh International Florida Artificial Intelligence Research Society Conference (FLAIRS 1998)
Volume
Issue:
Proceedings of the Eleventh International Florida Artificial Intelligence Research Society Conference (FLAIRS 1998)
Track:
All Papers
Downloads:
Abstract:
Calculating the incremental worth or weight of the individual components of an aggregate set when only the total worth or weight of the whole set is known is a problem common to several domains. In this article we describe an algorithm capable of inducing such incremental worth from a database of similar (but not identical) aggregate sets. The algorithm focuses on finding aggregate sets in the database that exhibit minimal differences in their corresponding components (referred to here as attributes and their values). This procedure isolates the disimilarities between nearly similar aggregate sets so that any difference in worth between the sets is attributed to these dissimilarities. In effect, this algorithm sm'ves as a mapping function that maps the makeup and overall wcecth cf an aggregate set into the incremental wcrth of its individual attributes. It could also be categorized as a way of calculating interpolation vectors for the attributes in the aggregate set.
FLAIRS
Proceedings of the Eleventh International Florida Artificial Intelligence Research Society Conference (FLAIRS 1998)
ISBN 978-1-57735-051-4
Published by The AAAI Press, Menlo Park, California