| Class | Description |
|---|---|
| BoundedGreedySelection |
Tries to reduce the complexity of the greedy selection algorithm first selecting
the best b�k cases according to their similarity to the query and then applies
the greedy selection method to these cases.
|
| BoundedRandomSelection |
Is the simplest diversity strategy: select the k cases at random from a larger
set of the b�k most similar cases to the query.
|
| GreedySelection |
This method incrementally builds a retrieval set, R.
|
Copyright © 2018 Group of Artificial Intelligence Applications (GAIA). All rights reserved.