Detection of tonals in lofargrams using connectionist methods

Author(s):  
D.M. Weber ◽  
C.C. Kruger
1999 ◽  
Vol 09 (03) ◽  
pp. 257-264
Author(s):  
C. NOBRE ◽  
E. MARTINELI ◽  
A. BRAGA ◽  
A. de CARVALHO ◽  
S. REZENDE ◽  
...  

The use of a linguistic representation for expressing knowledge acquired by learning systems is an important issue as regards to user understanding. Under this assumption, and to make sure that these systems will be welcome and used, several techniques have been developed by the artificial intelligence community, under both the symbolic and the connectionist approaches. This work discusses and investigates three knowledge extraction techniques based on these approaches. The first two techniques, the C4.5 [12] and CN2 [6] symbolic learning algorithms, extract knowledge directly from the data set. The last technique, the TREPAN algorithm [10] extracts knowledge from a previously trained neural network. The CN2 algorithm induces if … then rules from a given data set. The C4.5 algorithm extracts decision trees, although it can also extract ordered rules, from the data set. Decision trees are also the knowledge representation used by the TREPAN algorithm.


Author(s):  
Bruno Gas ◽  
◽  
Jean Luc Zarader ◽  
Cyril Chavy

In this article we propose a new speech signal coding model applied to the recognition of phonemes. This model is an extension to the non linear area of adaptive coding systems used in speech processing. For this purpose, we use predictive connectionist methods. We show that it is possible to take into account class membership information of the phonemes from the stage of coding. To evaluate the NPC encoder, a study of a database of phonemes by discriminant analysis and an application to phonemes recognition are carried out. Simulations presented here show that classification has obviously been improved, compared to currently used types of coding.


Author(s):  
Mohammad Hossein Ahmadi ◽  
Afshin Tatar ◽  
Mohammad Alhuyi Nazari ◽  
Roghayeh Ghasempour ◽  
Ali J. Chamkha ◽  
...  

Author(s):  
Mohammad Hossein Ahmadi ◽  
Mohammad Alhuyi Nazari ◽  
Roghayeh Ghasempour ◽  
Heydar Madah ◽  
Mohammad Behshad Shafii ◽  
...  

1990 ◽  
Vol 2 (4) ◽  
pp. 523-535 ◽  
Author(s):  
James A. Reggia ◽  
Mark Edwards

A phase transition in a connectionist model refers to a qualitative change in the model's behavior as parameters determining the spread of activation (gain, decay rate, etc.) pass through certain critical values. As connectionist methods have been increasingly adopted to model various problems in neuroscience, artificial intelligence, and cognitive science, there has been an increased need to understand and predict these phase transitions to assure meaningful model behavior. This paper extends previous results on phase transitions to encompass a class of connectionist models having rapidly varying connection strengths (“fast weights”). Phase transitions are predicted theoretically and then verified through a series of computer simulations. These results broaden the range of connectionist models for which phase transitions are identified and lay the foundation for future studies comparing models with rapidly varying and slowly varying connection strengths.


Sign in / Sign up

Export Citation Format

Share Document