Document Server@UHasselt >
Research publications >
Please use this identifier to cite or link to this item:
|Title: ||Strong similarity measures for ordered sets of documents in information retrieval|
|Authors: ||EGGHE, Leo|
|Issue Date: ||2002|
|Citation: ||Information Processing & Management, 38(6). p. 823-848|
|Abstract: ||A general method is presented to construct ordered similarity measures (OS-measures), i.e., similarity measures for ordered sets of documents (as, e.g., being the result of an IR-process), based on classical, well-known similarity measures for ordinary sets (measures such as Jaccard, Dice, Cosine or overlap measures). To this extent, we first present a review of these measures and their relationships.
The method given here to construct OS-measures extends the one given by Michel in a previous paper so that it becomes applicable on any pair of ordered sets. Concrete expressions of this method, applied to the classical similarity measures, are given.
Some of these measures are then tested in the IR-system Profil-Doc. The engine SPIRIT© extracts ranked document sets in three different contexts, each for 550 requests. The practical usability of the OS-measures is then discussed based on these experiments.|
|ISI #: ||000178417500006|
|Type: ||Journal Contribution|
|Validation: ||ecoom, 2003|
|Appears in Collections: ||Research publications|
Files in This Item:
|Published version||392.76 kB||Adobe PDF|
|Non peer-reviewed author version||734.51 kB||Adobe PDF|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.