The Experiments with the Linear Combination Data Fusion Method in Information Retrieval

Shengli Wu, Yaxin Bi, Xiaoqin Zeng, Lixin Han

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

Abstract

In data fusion, the linear combination method is a very flexible method since different weights can be assigned to different systems. However, it remains an open question that which weighting schema is good. In many cases, a simple weighting schema was used: for a system, its weight is assigned as its average performance over a group of training queries. In this paper, we empirically investigate the weighting issue. We find that, a series of power functions of average performance, which can be implemented as efficiently as the simple weighting schema, is more effective than the simple weighting schema for data fusion. We also investigate combined weights which concern both performance of component results and dissimilarity among component results. Further performance improvement on data fusion is achievable by using the combined weights.
LanguageEnglish
Title of host publicationProgress in WWW Research and Development Lecture Notes in Computer Science
Pages432-437
Publication statusPublished - 2008

Fingerprint

Data fusion
Information retrieval
Experiments

Keywords

  • Linear Combination
  • Data Fusion
  • Information Retrieval

Cite this

Wu, S., Bi, Y., Zeng, X., & Han, L. (2008). The Experiments with the Linear Combination Data Fusion Method in Information Retrieval. In Progress in WWW Research and Development Lecture Notes in Computer Science (pp. 432-437)
Wu, Shengli ; Bi, Yaxin ; Zeng, Xiaoqin ; Han, Lixin. / The Experiments with the Linear Combination Data Fusion Method in Information Retrieval. Progress in WWW Research and Development Lecture Notes in Computer Science. 2008. pp. 432-437
@inbook{87263818d4f248b7a2c18a47c7a09951,
title = "The Experiments with the Linear Combination Data Fusion Method in Information Retrieval",
abstract = "In data fusion, the linear combination method is a very flexible method since different weights can be assigned to different systems. However, it remains an open question that which weighting schema is good. In many cases, a simple weighting schema was used: for a system, its weight is assigned as its average performance over a group of training queries. In this paper, we empirically investigate the weighting issue. We find that, a series of power functions of average performance, which can be implemented as efficiently as the simple weighting schema, is more effective than the simple weighting schema for data fusion. We also investigate combined weights which concern both performance of component results and dissimilarity among component results. Further performance improvement on data fusion is achievable by using the combined weights.",
keywords = "Linear Combination, Data Fusion, Information Retrieval",
author = "Shengli Wu and Yaxin Bi and Xiaoqin Zeng and Lixin Han",
year = "2008",
language = "English",
isbn = "978-3-540-78848-5",
pages = "432--437",
booktitle = "Progress in WWW Research and Development Lecture Notes in Computer Science",

}

Wu, S, Bi, Y, Zeng, X & Han, L 2008, The Experiments with the Linear Combination Data Fusion Method in Information Retrieval. in Progress in WWW Research and Development Lecture Notes in Computer Science. pp. 432-437.

The Experiments with the Linear Combination Data Fusion Method in Information Retrieval. / Wu, Shengli; Bi, Yaxin; Zeng, Xiaoqin; Han, Lixin.

Progress in WWW Research and Development Lecture Notes in Computer Science. 2008. p. 432-437.

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - The Experiments with the Linear Combination Data Fusion Method in Information Retrieval

AU - Wu, Shengli

AU - Bi, Yaxin

AU - Zeng, Xiaoqin

AU - Han, Lixin

PY - 2008

Y1 - 2008

N2 - In data fusion, the linear combination method is a very flexible method since different weights can be assigned to different systems. However, it remains an open question that which weighting schema is good. In many cases, a simple weighting schema was used: for a system, its weight is assigned as its average performance over a group of training queries. In this paper, we empirically investigate the weighting issue. We find that, a series of power functions of average performance, which can be implemented as efficiently as the simple weighting schema, is more effective than the simple weighting schema for data fusion. We also investigate combined weights which concern both performance of component results and dissimilarity among component results. Further performance improvement on data fusion is achievable by using the combined weights.

AB - In data fusion, the linear combination method is a very flexible method since different weights can be assigned to different systems. However, it remains an open question that which weighting schema is good. In many cases, a simple weighting schema was used: for a system, its weight is assigned as its average performance over a group of training queries. In this paper, we empirically investigate the weighting issue. We find that, a series of power functions of average performance, which can be implemented as efficiently as the simple weighting schema, is more effective than the simple weighting schema for data fusion. We also investigate combined weights which concern both performance of component results and dissimilarity among component results. Further performance improvement on data fusion is achievable by using the combined weights.

KW - Linear Combination

KW - Data Fusion

KW - Information Retrieval

M3 - Chapter

SN - 978-3-540-78848-5

SP - 432

EP - 437

BT - Progress in WWW Research and Development Lecture Notes in Computer Science

ER -

Wu S, Bi Y, Zeng X, Han L. The Experiments with the Linear Combination Data Fusion Method in Information Retrieval. In Progress in WWW Research and Development Lecture Notes in Computer Science. 2008. p. 432-437