Sciweavers

3517 search results - page 177 / 704
» Online Learning with Queries
Sort
View
DIS
1998
Springer
15 years 10 months ago
Uniform Characterizations of Polynomial-Query Learnabilities
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...
Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara...
PVLDB
2008
118views more  PVLDB 2008»
15 years 6 months ago
Efficient top-k processing over query-dependent functions
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...
Lin Guo, Sihem Amer-Yahia, Raghu Ramakrishnan, Jay...
SIAMCOMP
1998
86views more  SIAMCOMP 1998»
15 years 6 months ago
Exact Learning of Discretized Geometric Concepts
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldm...
ICRA
2005
IEEE
118views Robotics» more  ICRA 2005»
16 years 3 days ago
Learning-Assisted Multi-Step Planning
— Probabilistic sampling-based motion planners are unable to detect when no feasible path exists. A common heuristic is to declare a query infeasible if a path is not found in a ...
Kris K. Hauser, Timothy Bretl, Jean-Claude Latombe
IADIS
2004
15 years 8 months ago
Relevance feedback using semantic association between indexing terms in large free text corpuses
Relevance feedback has been considered as a means of incorporating learning into information retrieval systems for quite sometime now. This paper discusses the research results of...
Shahzad Khan, Kenan Azam