Sciweavers

659 search results - page 114 / 132
» Data mining with an ant colony optimization algorithm
Sort
View
136
Voted
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
14 years 7 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
WSDM
2012
ACM
236views Data Mining» more  WSDM 2012»
13 years 5 months ago
Effective query formulation with multiple information sources
Most standard information retrieval models use a single source of information (e.g., the retrieval corpus) for query formulation tasks such as term and phrase weighting and query ...
Michael Bendersky, Donald Metzler, W. Bruce Croft
KDD
2008
ACM
167views Data Mining» more  KDD 2008»
15 years 10 months ago
A sequential dual method for large scale multi-class linear svms
Efficient training of direct multi-class formulations of linear Support Vector Machines is very useful in applications such as text classification with a huge number examples as w...
S. Sathiya Keerthi, S. Sundararajan, Kai-Wei Chang...
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
15 years 10 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
97
Voted
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
14 years 8 months ago
Laplacian Spectrum Learning
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
Pannagadatta K. Shivaswamy, Tony Jebara