Sciweavers

2455 search results - page 125 / 491
» Learning Composite Concepts
Sort
View
ALT
1998
Springer
15 years 9 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
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 ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
ESANN
2007
15 years 6 months ago
A supervised learning approach based on STDP and polychronization in spiking neuron networks
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...
Hélène Paugam-Moisy, Régis Ma...
ECCC
2006
97views more  ECCC 2006»
15 years 5 months ago
Cryptographic Hardness Results for Learning Intersections of Halfspaces
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
Adam R. Klivans, Alexander A. Sherstov
NN
2006
Springer
146views Neural Networks» more  NN 2006»
15 years 5 months ago
Comparison of relevance learning vector quantization with other metric adaptive classification methods
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...
Thomas Villmann, Frank-Michael Schleif, Barbara Ha...
DGO
2003
124views Education» more  DGO 2003»
15 years 6 months ago
Semantic Web Enabled E-Government Services
We propose a novel approach for organizing and describing e-government services on the envisioned Semantic Web. We combine the emerging concepts of Web services and ontologies to ...
Brahim Medjahed, Athman Bouguettaya, Mourad Ouzzan...