Sciweavers

265 search results - page 4 / 53
» How Many Query Superpositions Are Needed to Learn
Sort
View
ECIR
2007
Springer
13 years 7 months ago
Active Learning with History-Based Query Selection for Text Categorisation
Automated text categorisation systems learn a generalised hypothesis from large numbers of labelled examples. However, in many domains labelled data is scarce and expensive to obta...
Michael Davy, Saturnino Luz
ICML
2005
IEEE
14 years 6 months ago
Active learning for Hidden Markov Models: objective functions and algorithms
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
Brigham Anderson, Andrew Moore
IJCAI
2003
13 years 7 months ago
Statistics Gathering for Learning from Distributed, Heterogeneous and Autonomous Data Sources
With the growing use of distributed information networks, there is an increasing need for algorithmic and system solutions for data-driven knowledge acquisition using distributed,...
Doina Caragea, Jaime Reinoso, Adrian Silvescu, Vas...
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
13 years 11 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
WWW
2007
ACM
14 years 6 months ago
Identifying ambiguous queries in web search
It is widely believed that some queries submitted to search engines are by nature ambiguous (e.g., java, apple). However, few studies have investigated the questions of "how ...
Ruihua Song, Zhenxiao Luo, Ji-Rong Wen, Yong Yu, H...