Sciweavers

160 search results - page 13 / 32
» Reductions for Learning via Queries
Sort
View
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
ICTAI
2010
IEEE
13 years 5 months ago
Instance-Based Ensemble Pruning via Multi-Label Classification
Ensemble pruning is concerned with the reduction of the size of an ensemble prior to its combination. Its purpose is to reduce the space and time complexity of the ensemble and/or ...
Fotini Markatopoulou, Grigorios Tsoumakas, Ioannis...
PR
2011
12 years 10 months ago
A survey of multilinear subspace learning for tensor data
Increasingly large amount of multidimensional data are being generated on a daily basis in many applications. This leads to a strong demand for learning algorithms to extract usef...
Haiping Lu, Konstantinos N. Plataniotis, Anastasio...
CIKM
2009
Springer
14 years 2 months ago
Semi-supervised learning of semantic classes for query understanding: from the web and for the web
Understanding intents from search queries can improve a user’s search experience and boost a site’s advertising profits. Query tagging via statistical sequential labeling mode...
Ye-Yi Wang, Raphael Hoffmann, Xiao Li, Jakub Szyma...
CW
2005
IEEE
14 years 1 months ago
Applying Transformation-Based Error-Driven Learning to Structured Natural Language Queries
XML information retrieval (XML-IR) systems aim to provide users with highly exhaustive and highly specific results. To interact with XML-IR systems, users must express both their ...
Alan Woodley, Shlomo Geva