Sciweavers

288 search results - page 8 / 58
» Document generality: its computation for ranking
Sort
View
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
14 years 9 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
CIKM
2009
Springer
15 years 1 months ago
Efficient feature weighting methods for ranking
Feature weighting or selection is a crucial process to identify an important subset of features from a data set. Removing irrelevant or redundant features can improve the generali...
Hwanjo Yu, Jinoh Oh, Wook-Shin Han
SIGIR
2008
ACM
14 years 9 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...
ACMSE
2004
ACM
15 years 3 months ago
SA_MetaMatch: relevant document discovery through document metadata and indexing
SA_MetaMatch, a component of the Standards Advisor (SA), is designed to find relevant documents through matching indices of metadata and document content. The elements in the meta...
Hiu S. Yau, J. Scott Hawker
AIRS
2010
Springer
14 years 7 months ago
Relevance Ranking Using Kernels
This paper is concerned with relevance ranking in search, particularly that using term dependency information. It proposes a novel and unified approach to relevance ranking using ...
Jun Xu, Hang Li, Chaoliang Zhong