Julien Ah-Pine
Web Intelligence 2008 (WI’08), Sydney, Australia, 9-12 December 2008
Web Intelligence Held in conjunction with The 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology.
In this paper, we address the problem of unsupervisedrank aggregation in the context of meta-searching in information retrieval field. The first goal of this paper is to apply aggregation operators that are defined in information fusion domain to the particular issue mentioned beforehand. Triangular
norms, conorms and quasi-arithmetic means, are such kind of operators. Then, the second goal of this work is to introduce a new aggregation function, its logical foundations and its combinatorial properties. Particularly, this
operator allows to take into account the relationships between experts in a flexible way. Finally, we test these different aggregation operators on the LETOR dataset. The results of our experiments show that this kind of aggregation functions can lead to better results than baseline methods
such as CombSUM and CombMNZ approaches
Report number: