Sciweavers

19 search results - page 1 / 4
» Learning via Finitely Many Queries
Sort
View
AMAI
2004
Springer
13 years 10 months ago
Learning via Finitely Many Queries
This work introduces a new query inference model that can access data and communicate with a teacher by asking finitely many boolean queries in a language L. In this model the pa...
Andrew C. Lee
ALT
2006
Springer
14 years 1 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
SIGIR
2011
ACM
12 years 7 months ago
Learning search tasks in queries and web pages via graph regularization
As the Internet grows explosively, search engines play a more and more important role for users in effectively accessing online information. Recently, it has been recognized that ...
Ming Ji, Jun Yan, Siyu Gu, Jiawei Han, Xiaofei He,...
ICGI
2010
Springer
13 years 6 months ago
Generalizing over Several Learning Settings
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
Anna Kasprzik
SEMWEB
2009
Springer
13 years 11 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...