| * | 2002 |
|---|
| 12 | EE | Llew Mason,
Peter L. Bartlett,
Mostefa Golea:
Generalization Error of Combined Classifiers.
J. Comput. Syst. Sci. 65(2): 415-438 (2002) |
| 1998 |
|---|
| 11 | EE | Alan B. Tickle,
Robert Andrews,
Mostefa Golea,
Joachim Diederich:
The truth will come to light: directions and challenges in extracting the knowledge embedded within trained artificial neural networks.
IEEE Transactions on Neural Networks 9(6): 1057-1068 (1998) |
| 1997 |
|---|
| 10 | | Mostefa Golea,
Peter L. Bartlett,
Wee Sun Lee,
Llew Mason:
Generalization in Decision Trees and DNF: Does Size Matter?
NIPS 1997 |
| 1996 |
|---|
| 9 | | Mostefa Golea,
Masahiro Matsuoka,
Yasubumi Sakakibara:
Stochastic simple recurrent neural networks.
ICGI 1996: 262-273 |
| 8 | EE | Mostefa Golea,
Mario Marchand,
Thomas R. Hancock:
On learning ?-perceptron networks on the uniform distribution.
Neural Networks 9(1): 67-82 (1996) |
| 1995 |
|---|
| 7 | | Mostefa Golea:
Average case analysis of a learning algorithm for µ-DNF expressions.
EuroCOLT 1995: 342-356 |
| 1994 |
|---|
| 6 | EE | Mostefa Golea:
Average Case Analysis of an Hebb-Type Rule that Finds the Network Connectivity.
Int. J. Neural Syst. 5(2): 115-122 (1994) |
| 5 | | Thomas R. Hancock,
Mostefa Golea,
Mario Marchand:
Learning Nonoverlapping Perceptron Networks from Examples and Membership Queries.
Machine Learning 16(3): 161-183 (1994) |
| 1993 |
|---|
| 4 | EE | Mostefa Golea,
Mario Marchand:
Average Case Analysis of the Clipped Hebb Rule for Nonoverlapping Perception Networks.
COLT 1993: 151-157 |
| 3 | | Mostefa Golea,
Mario Marchand:
Polynomial Time Algorithms for Learning Neural Nets of NonoverlappingPerceptrons.
Computational Intelligence 9: 155-170 (1993) |
| 2 | EE | Mostefa Golea,
Mario Marchand:
On Learning Perceptrons with Binary Weights.
Neural Computation 5(5): 767-782 (1993) |
| 1992 |
|---|
| 1 | EE | Mostefa Golea,
Mario Marchand,
Thomas R. Hancock:
On Learning µ-Perceptron Networks with Binary Weights.
NIPS 1992: 591-598 |
