Sciweavers

2018 search results - page 83 / 404
» Magnitude-preserving ranking algorithms
Sort
View
CIKM
2010
Springer
15 years 4 months ago
Online learning for recency search ranking using real-time user feedback
Traditional machine-learned ranking algorithms for web search are trained in batch mode, which assume static relevance of documents for a given query. Although such a batch-learni...
Taesup Moon, Lihong Li, Wei Chu, Ciya Liao, Zhaohu...
163
Voted
RSFDGRC
2005
Springer
110views Data Mining» more  RSFDGRC 2005»
15 years 11 months ago
A Rough Set Based Model to Rank the Importance of Association Rules
Abstract. Association rule algorithms often generate an excessive number of rules, many of which are not significant. It is difficult to determine which rules are more useful, int...
Jiye Li, Nick Cercone
182
Voted
KDD
2009
ACM
245views Data Mining» more  KDD 2009»
16 years 6 months ago
Mining rich session context to improve web search
User browsing information, particularly their non-search related activity, reveals important contextual information on the preferences and the intent of web users. In this paper, ...
Guangyu Zhu, Gilad Mishne
IPM
2008
100views more  IPM 2008»
15 years 6 months ago
Query-level loss functions for information retrieval
Many machine learning technologies such as support vector machines, boosting, and neural networks have been applied to the ranking problem in information retrieval. However, since...
Tao Qin, Xu-Dong Zhang, Ming-Feng Tsai, De-Sheng W...
ICIP
1999
IEEE
16 years 7 months ago
A Fast Algorithm for Rigid Structure from Image Sequences
The factorization method [1] is a feature-based approach to recover 3D rigid structure from motion. In [2], we extended their framework to recover a parametric description of the ...
Pedro M. Q. Aguiar, José M. F. Moura