Premium
Performance optimization of object comparison
Author(s) -
Hallez Axel,
Tré Guy De,
Bronselaer Antoon
Publication year - 2009
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.20373
Subject(s) - object (grammar) , set (abstract data type) , computer science , process (computing) , scheme (mathematics) , reduction (mathematics) , selection (genetic algorithm) , algorithm , mathematical optimization , order (exchange) , mathematics , artificial intelligence , mathematical analysis , geometry , finance , economics , programming language , operating system
Comparing objects can be considered as a hierarchical process. Separate aspects of objects are compared to each other, and the results of these comparisons are combined into a single result in one or more steps by aggregation operators. The set of operators used to compare the objects and the way these operators are related with each other is called the comparison scheme. If a threshold is applied to the final result of the object comparison, the mathematical properties of the operators in the comparison scheme can be used to derive thresholds on the intermediate results. These derived threshold can be used to break of a comparison early, thus offering a reduction of the comparison cost. Using this information, we show that the order in which the operators are evaluated has an influence on the average cost of comparing two objects. Next, we proceed with a study of the properties that allow us to find an optimal order, such that this average cost is minimized. Finally, we provide an algorithm that calculates an optimal order efficiently. Although specifically developed for object comparison, the algorithm can be applied to all kinds of selection processes that involve the combination of several test results. © 2009 Wiley Periodicals, Inc.