Poset representation and similarity comparisons os systems in IR
Christine Michel (LIESP, Ictt)

TL;DR
This paper introduces a poset-based approach to represent and compare complex IR system answers, incorporating clustering and ranking, and proposes new similarity measures for enhanced comparison accuracy.
Contribution
It presents a novel poset representation framework and a general method for constructing similarity measures that consider both clustering and ranking in IR answers.
Findings
Poset representation effectively models complex IR answers.
New similarity measures account for clustering and ranking.
Similarity indicator increases with common answer ranks.
Abstract
In this paper we are using the poset representation to describe the complex answers given by IR systems after a clustering and ranking processes. The answers considered may be given by cartographical representations or by thematic sub-lists of documents. The poset representation, with the graph theory and the relational representation opens many perspectives in the definition of new similarity measures capable of taking into account both the clustering and ranking processes. We present a general method for constructing new similarity measures and give several examples. These measures can be used for semi-ordered partitions; moreover, in the comparison of two sets of answers, the corresponding similarity indicator is an increasing function of the ranks of presentation of common answers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInformation Retrieval and Search Behavior · Advanced Clustering Algorithms Research · History and advancements in chemistry
