Mostefa Golea

According to our database1, Mostefa Golea authored at least 15 papers between 1992 and 2002.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2002
Generalization Error of Combined Classifiers.
J. Comput. Syst. Sci., 2002

1998
The truth will come to light: directions and challenges in extracting the knowledge embedded within trained artificial neural networks.
IEEE Trans. Neural Networks, 1998

1997
Generalization in Decision Trees and DNF: Does Size Matter?
Proceedings of the Advances in Neural Information Processing Systems 10, 1997

The truth is in there: current issues in extracting rules from trained feedforward artificial neural networks.
Proceedings of International Conference on Neural Networks (ICNN'97), 1997

1996
On learning ?-perceptron networks on the uniform distribution.
Neural Networks, 1996

Stochastic simple recurrent neural networks.
Proceedings of the Grammatical Inference: Learning Syntax from Sentences, 1996

1995
Simple recurrent networks as generalized hidden Markov models with distributed representations.
Proceedings of International Conference on Neural Networks (ICNN'95), Perth, WA, Australia, November 27, 1995

Average case analysis of a learning algorithm for µ-DNF expressions.
Proceedings of the Computational Learning Theory, Second European Conference, 1995

1994
Learning Nonoverlapping Perceptron Networks from Examples and Membership Queries.
Mach. Learn., 1994

Average Case Analysis of an Hebb-Type Rule that Finds the Network Connectivity.
Int. J. Neural Syst., 1994

1993
On Learning Perceptrons with Binary Weights.
Neural Comput., 1993

Polynomial Time Algorithms for Learning Neural Nets of NonoverlappingPerceptrons.
Comput. Intell., 1993

On learning simple deterministic and probabilistic neural concepts.
Proceedings of the First European Conference on Computational Learning Theory, 1993

Average Case Analysis of the Clipped Hebb Rule for Nonoverlapping Perception Networks.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992
On Learning µ-Perceptron Networks with Binary Weights.
Proceedings of the Advances in Neural Information Processing Systems 5, [NIPS Conference, Denver, Colorado, USA, November 30, 1992


  Loading...