Sciweavers

2523 search results - page 12 / 505
» A general matrix framework for modelling Information Retriev...
Sort
View
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
14 years 8 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
CIKM
2010
Springer
13 years 5 months ago
A unified optimization framework for robust pseudo-relevance feedback algorithms
We present a flexible new optimization framework for finding effective, reliable pseudo-relevance feedback models that unifies existing complementary approaches in a principled wa...
Joshua V. Dillon, Kevyn Collins-Thompson
ICCS
2005
Springer
14 years 1 months ago
Adaptive Model Trust Region Methods for Generalized Eigenvalue Problems
Computing a few eigenpairs of large-scale matrices is a significant problem in science and engineering applications and a very active area of research. In this paper, two methods...
Pierre-Antoine Absil, C. G. Baker, Kyle A. Galliva...
SIGIR
2010
ACM
13 years 11 months ago
On statistical analysis and optimization of information retrieval effectiveness metrics
This paper presents a new way of thinking for IR metric optimization. It is argued that the optimal ranking problem should be factorized into two distinct yet interrelated stages:...
Jun Wang, Jianhan Zhu
SIGIR
2003
ACM
14 years 28 days ago
Beyond independent relevance: methods and evaluation metrics for subtopic retrieval
We present a non-traditional retrieval problem we call subtopic retrieval. The subtopic retrieval problem is concerned with finding documents that cover many different subtopics ...
ChengXiang Zhai, William W. Cohen, John D. Laffert...