Sciweavers

1413 search results - page 80 / 283
» Efficient Learning of Semi-structured Data from Queries
Sort
View
COLT
1998
Springer
15 years 10 months ago
Self Bounding Learning Algorithms
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
Yoav Freund
VLDB
2004
ACM
129views Database» more  VLDB 2004»
15 years 11 months ago
Probabilistic Ranking of Database Query Results
We investigate the problem of ranking answers to a database query when many tuples are returned. We adapt and apply principles of probabilistic models from Information Retrieval f...
Surajit Chaudhuri, Gautam Das, Vagelis Hristidis, ...
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
16 years 7 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
DBISP2P
2006
Springer
195views Database» more  DBISP2P 2006»
15 years 9 months ago
XML Query Routing in Structured P2P Systems
Abstract. This paper addresses the problem of data placement, indexing, and querying large XML data repositories distributed over an existing P2P service infrastructure. Our archit...
Leonidas Fegaras, Weimin He, Gautam Das, David Lev...
HRI
2010
ACM
15 years 11 months ago
Transparent active learning for robots
—This research aims to enable robots to learn from human teachers. Motivated by human social learning, we believe that a transparent learning process can help guide the human tea...
Crystal Chao, Maya Cakmak, Andrea Lockerd Thomaz