Sciweavers

160 search results - page 10 / 32
» Reductions for Learning via Queries
Sort
View
SIGIR
2009
ACM
14 years 1 months ago
An improved markov random field model for supporting verbose queries
Recent work in supervised learning of term-based retrieval models has shown significantly improved accuracy can often be achieved via better model estimation [2, 10, 11, 17]. In ...
Matthew Lease
WWW
2007
ACM
14 years 8 months ago
Understanding web search via a learning paradigm
Investigating whether one can view Web searching as a learning process, we examined the searching characteristics of 41 participants engaged in 246 searching tasks. We classified ...
Bernard J. Jansen, Brian Keith Smith, Danielle L. ...
SEMWEB
2009
Springer
14 years 1 months ago
Actively Learning Ontology Matching via User Interaction
Ontology matching plays a key role for semantic interoperability. Many methods have been proposed for automatically finding the alignment between heterogeneous ontologies. However...
Feng Shi, Juanzi Li, Jie Tang, Guo Tong Xie, Hanyu...
SADM
2010
173views more  SADM 2010»
13 years 2 months ago
Data reduction in classification: A simulated annealing based projection method
This paper is concerned with classifying high dimensional data into one of two categories. In various settings, such as when dealing with fMRI and microarray data, the number of v...
Tian Siva Tian, Rand R. Wilcox, Gareth M. James
ALT
2006
Springer
14 years 4 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro