Sciweavers

6095 search results - page 240 / 1219
» Learning in Local Search
Sort
View
NPL
2006
82views more  NPL 2006»
15 years 5 months ago
How Online Learning Approaches Ornstein Uhlenbeck Processes
We show that under reasonable conditions, online learning for a nonlinear function near a local minimum is similar to a multivariate Ornstein Uhlenbeck process. This implies that ...
Fredrik A. Dahl
223
Voted
BMCBI
2011
15 years 15 days ago
Accurate statistics for local sequence alignment with position-dependent scoring by rare-event sampling
Background: Molecular database search tools need statistical models to assess the significance for the resulting hits. In the classical approach one asks the question how probable...
Stefan Wolfsheimer, Inke Herms, Sven Rahmann, Alex...
WSDM
2010
ACM
194views Data Mining» more  WSDM 2010»
16 years 2 months ago
Ranking with Query-Dependent Loss for Web Search
Queries describe the users' search intent and therefore they play an essential role in the context of ranking for information retrieval and Web search. However, most of exist...
Jiang Bian, Tie-Yan Liu, Tao Qin, Hongyuan Zha
COMCOM
2008
127views more  COMCOM 2008»
15 years 5 months ago
A dynamic routing protocol for keyword search in unstructured peer-to-peer networks
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
Cong Shi, Dingyi Han, Yuanjie Liu, Shicong Meng, Y...
WWW
2010
ACM
16 years 14 days ago
Large-scale bot detection for search engines
In this paper, we propose a semi-supervised learning approach for classifying program (bot) generated web search traffic from that of genuine human users. The work is motivated by...
Hongwen Kang, Kuansan Wang, David Soukal, Fritz Be...