![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Mostefa Golea
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
- [j7]Llew Mason, Peter L. Bartlett
, Mostefa Golea:
Generalization Error of Combined Classifiers. J. Comput. Syst. Sci. 65(2): 415-438 (2002)
1990 – 1999
- 1998
- [j6]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 Trans. Neural Networks 9(6): 1057-1068 (1998) - 1997
- [c8]Alan B. Tickle, Mostefa Golea, Ross Hayward, Joachim Diederich:
The truth is in there: current issues in extracting rules from trained feedforward artificial neural networks. ICNN 1997: 2530-2534 - [c7]Mostefa Golea, Peter L. Bartlett, Wee Sun Lee, Llew Mason:
Generalization in Decision Trees and DNF: Does Size Matter? NIPS 1997: 259-265 - 1996
- [j5]Mostefa Golea, Mario Marchand
, Thomas R. Hancock:
On learning ?-perceptron networks on the uniform distribution. Neural Networks 9(1): 67-82 (1996) - [c6]Mostefa Golea, Masahiro Matsuoka, Yasubumi Sakakibara:
Stochastic simple recurrent neural networks. ICGI 1996: 262-273 - 1995
- [c5]Mostefa Golea:
Average case analysis of a learning algorithm for µ-DNF expressions. EuroCOLT 1995: 342-356 - [c4]Yasubumi Sakakibara, Mostefa Golea:
Simple recurrent networks as generalized hidden Markov models with distributed representations. ICNN 1995: 979-984 - 1994
- [j4]Mostefa Golea:
Average Case Analysis of an Hebb-Type Rule that Finds the Network Connectivity. Int. J. Neural Syst. 5(2): 115-122 (1994) - [j3]Thomas R. Hancock, Mostefa Golea, Mario Marchand
:
Learning Nonoverlapping Perceptron Networks from Examples and Membership Queries. Mach. Learn. 16(3): 161-183 (1994) - 1993
- [j2]Mostefa Golea, Mario Marchand:
Polynomial Time Algorithms for Learning Neural Nets of NonoverlappingPerceptrons. Comput. Intell. 9: 155-170 (1993) - [j1]Mostefa Golea, Mario Marchand:
On Learning Perceptrons with Binary Weights. Neural Comput. 5(5): 767-782 (1993) - [c3]Mostefa Golea, Mario Marchand:
Average Case Analysis of the Clipped Hebb Rule for Nonoverlapping Perception Networks. COLT 1993: 151-157 - [c2]Mostefa Golea, Mario Marchand:
On learning simple deterministic and probabilistic neural concepts. EuroCOLT 1993: 47-60 - 1992
- [c1]Mostefa Golea, Mario Marchand, Thomas R. Hancock:
On Learning µ-Perceptron Networks with Binary Weights. NIPS 1992: 591-598
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint