1106 search results - page 56 / 222 » On regularization algorithms in learning theory |
AAAI
2007
15 years 7 months ago
2007
The goal of our current research is machine learning with the help and guidance of a knowledge base (KB). Rather than learning numerical models, our approach generates explicit sy...
161
click to vote
NIPS
2004
15 years 6 months ago
2004
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...
140
click to vote
DOCENG
2003
ACM
15 years 10 months ago
2003
ACM
By exploiting the theories of automata and graphs, we propose algorithms and a process for editing valid XML documents [4][5]. The editing process avoids syntactic violations alto...
141
Voted
KAIS
2000
15 years 4 months ago
2000
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...
136
click to vote
ECCC
2006
15 years 4 months ago
2006
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...