A competitive neural network for blind separation of sources based on geometric properties

1997 ◽  
pp. 1095-1106 ◽  
Author(s):  
Alberto Prieto ◽  
Carlos G. Puntonet ◽  
Beatriz Prieto ◽  
Manuel Rodríguez-Alvarez
Keyword(s):  
Neural Network ◽  
Blind Separation ◽  
Geometric Properties ◽  
Competitive Neural Network

K-Means and Competitive Neural Network Based Clustering of Climate Data

2021 ◽  
Author(s):  
Sandeep Kumar Sunori ◽  
Sudhanshu Maurya ◽  
Amit Mittal ◽  
Kiran Patni ◽  
Shweta Arora ◽  
...  
Keyword(s):  
Neural Network ◽  
Climate Data ◽  
Competitive Neural Network

An Optimizing Method of Competitive Neural Network

2011 ◽  
Vol 467-469 ◽  
pp. 894-899
Author(s):  
Hong Men ◽  
Hai Yan Liu ◽  
Lei Wang ◽  
Yun Peng Pan
Keyword(s):  
Neural Network ◽  
Network Structure ◽  
Clustering Analysis ◽  
Learning Rate ◽  
Optimum Number ◽  
Number Of Clusters ◽  
Competitive Neural Network ◽  
Output Neurons ◽  
Simulation Results ◽  
Strong Ability

This paper presents an optimizing method of competitive neural network(CNN):During clustering analysis fixed on the optimum number of output neurons according to the change of DB value，and then adjusted connected weight including increasing ,dividing , delete. Each neuron had the different variety trend of learning rate according with the change of the probability of neurons. The optimizing method made classification more accurate. Simulation results showed that optimized network structure had a strong ability to adjust the number of clusters dynamically and good results of classification.

A COMPETITIVE NEURAL NETWORK APPROACH TO WEB-PAGE CATEGORIZATION

2001 ◽  
Vol 09 (06) ◽  
pp. 731-741 ◽  
Author(s):  
ZHI-QIANG LIU ◽  
YA-JUN ZHANG
Keyword(s):  
Neural Network ◽  
Real World ◽  
Gradient Descent ◽  
Web Pages ◽  
Learning Method ◽  
Network Approach ◽  
Web Page ◽  
Real World Data ◽  
Neural Network Approach ◽  
Competitive Neural Network

Recently many techniques, e.g., Google or AltaVista, are available for classifying well-organized, hierarchical crisp categories from human constructed web pages such as that in Yahoo. However, given the current rate of web-page production, there is an urgent need of classifiers that are able to autonomously classify web-page categories that have overlaps. In this paper, we present a competitive learning method for this problem, which based on a new objective function and gradient descent scheme. Experimental results on real-world data show that the approach proposed in this paper gives a better performance in classifying randomly-generated, knowledge-overlapped categories as well as hierarchical crisp categories.

Sign in / Sign up

Export Citation Format

Share Document