Frequency sensitive competitive learning for clustering on high-dimensional hyperspheres

Proceedings of the International Joint Conference on Neural Networks

Volumn 2, Issue , 2002, Pages 1590-1595

  Banerjee, Arindam ^a   Ghosh, Joydeep ^a  

^a The University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LEARNING SYSTEMS; MATHEMATICAL MODELS; MAXIMUM LIKELIHOOD ESTIMATION;

COMPETITIVE LEARNING; FREQUENCY SENSITIVE COMPETITIVE ALGORITHM;

NEURAL NETWORKS;

EID: 0036083217     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Competitive learning algorithms for vector quantization
2. Constrained k-means clustering
3. A massively parallel architecture for a self-organizing neural pattern recognition machine
4. Maximum likelihood from incomplete data via the EM algorithm
5. Efficient clustering of very large document collections
6. An overview of predictive learning and function approximation
7. Codeword distributed for frequency sensitive competitive learning with one-dimensional input data
8. Diffusion approximation of frequency sensitive competitive learning
9. Adaptive pattern classification and universal recoding: 1. Parallel development and coding of neutral feature detectors
10. Competitive learning: From interactive action to adaptive resonance
11. Data clustering: A review
12. Statistics of directional data
13. Feature discovery by competive learning
14. High-dimensional clustering using frequency sensitive competitive learning
15. Clustering based on conditional distributions in an auxiliary space
16. A scalable approach to balanced, high-dimensional clustering of market-baskets
17. Value-based customer grouping from large retail data-sets
18. Impact of similarity measures on web-page clustering