1890 search results - page 79 / 378 » Graph-Based Concept Learning |
145
click to vote
NIPS
1997
15 years 5 months ago
1997
Multiple-instance learning is a variation on supervised learning, where the task is to learn a concept given positive and negative bags of instances. Each bag may contain many ins...
138
click to vote
ALT
1998
Springer
15 years 8 months ago
1998
Springer
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
134
Voted
ESANN
2007
15 years 5 months ago
2007
We propose a network model of spiking neurons, without preimposed topology and driven by STDP (Spike-Time-Dependent Plasticity), a temporal Hebbian unsupervised learning mode, biol...
132
Voted
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 ...
144
click to vote
NN
2006
Springer
15 years 4 months ago
2006
Springer
The paper deals with the concept of relevance learning in learning vector quantization and classification. Recent machine learning approaches with the ability of metric adaptation...