Browsing by Subject "reference set condensation"

Now showing 1 - 2 of 2

Access status: Open Access ,
Cascade algorithm for the reference set size reduction
(Wydawnictwa AGH, 2009) Sierszeń, Artur
Two algorithms of the reference set condensation, one of which is based on finding the mutually furthest points and the other is the modification of the Chang's algorithm, are respectively of the incremental and eliminative type, i.e. the size of the condensed set increases or is reduced as a result of a subsequent iteration. The combination of both aforementioned types of condensation, i.e. the cascade algorithm of condensation, is more effective than each of these algorithms executed sepa-rately.
Access status: Open Access ,
Reduction of large reference sets with modified Chang's algorithm
(Wydawnictwa AGH, 2009) Sierszeń, Artur
The advantage of the Chang's algorithm is a considerable reduction of the reference set. Its drawback is relatively small speed. The modification proposed by the author of this article aims at accelerating computations by replacing a larger number of objects, not only a pair of them, with one object. For any object in the reference set, it is possible to determine all objects from the same class which are located at a shorter distance to it than any other object from a different class. This group of objects can be replaced by a single artificial object.