Sciweavers

388 search results - page 15 / 78
» The covering number in learning theory
Sort
View
TIT
1998
127views more  TIT 1998»
13 years 7 months ago
On a New Class of Codes for Identifying Vertices in Graphs
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. ...
KAIS
2000
106views more  KAIS 2000»
13 years 7 months ago
FANNC: A Fast Adaptive Neural Network Classifier
In this paper, a fast adaptive neural network classifier named FANNC is proposed. FANNC exploits the advantages of both adaptive resonance theory and field theory. It needs only on...
Zhi-Hua Zhou, Shifu Chen, Zhaoqian Chen
COLT
2003
Springer
14 years 17 days ago
Preference Elicitation and Query Learning
Abstract. In this paper we initiate an exploration of relationships between “preference elicitation”, a learning-style problem that arises in combinatorial auctions, and the pr...
Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, M...
ML
2000
ACM
13 years 7 months ago
Maximizing Theory Accuracy Through Selective Reinterpretation
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...
Shlomo Argamon-Engelson, Moshe Koppel, Hillel Walt...
CORR
2008
Springer
72views Education» more  CORR 2008»
13 years 7 months ago
Statistical Learning of Arbitrary Computable Classifiers
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
David Soloveichik