509 search results - page 92 / 102 » Using Learning for Approximation in Stochastic Processes |
ML
2002
ACM
13 years 7 months ago
2002
ACM
I describe a framework for interpreting Support Vector Machines (SVMs) as maximum a posteriori (MAP) solutions to inference problems with Gaussian Process priors. This probabilisti...
KCAP
2005
ACM
14 years 28 days ago
2005
ACM
Among the variety of alignment approaches (e.g., using machine learning, subsumption computation, formal concept analysis, etc.) similarity-based ones rely on a quantitative asses...
COMCOM
2008
13 years 7 months ago
2008
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...
ICA
2012
Springer
12 years 3 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
CHI
2009
ACM
14 years 8 months ago
2009
ACM
This paper reports results from a study in which we automatically classified the query reformulation patterns for 964,780 Web searching sessions (composed of 1,523,072 queries) in...