Competitive Learning and K-Means Clustering — Study Resources & PYQs
Unsupervised and competitive learning, and the K-means clustering algorithm
- Estimated study time: 60 minutes
Study resources
- Self Organizing Maps - Kohonen Maps — GeeksforGeeks (competitive learning, K-means-style clustering with Python code) (Article) — Self Organizing Maps - Kohonen Maps — GeeksforGeeks (competitive learning, K-means-style clustering with Python code) — selected for the syllabus topic Competitive Learning and K-Means Clustering.
- NPTEL Fuzzy Logic and Neural Networks, IIT Kharagpur (Article) — NPTEL course covering fuzzy sets, fuzzy reasoning, neural-network fundamentals, multilayer networks, RBF, self-organizing maps, recurrent networks and deep learning.
Competitive Learning and K-Means Clustering previous year questions
Taught in these subjects
- Artificial Neural Network — ECT-1704 · Government College of Engineering and Technology, Jammu