Implement self-organizing maps (SOMs) in `linfa-clustering`
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 4.7k
- Forks
- 334
- Avg merge
- 39m
- Merged PRs (30d)
- 1
Description
If possible, I'd like to add an implementation of self-organizing maps to linfa-clustering. Unlike many of the clustering algorithms already implemented in linfa, SOMs preserve topological relationships, offering a continuous map from n-dimensional space to a 2D grid. This makes SOMs particularly useful for visualizing higher-dimensional data compared to many alternatives such as k-means clustering, which simply partitions the data into clusters without necessarily maintaining spatial relationships or "distance" between points.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reviewing the existing clustering algorithms in linfa-clustering, especially the k-means implementation, and compare their APIs with the requirements of self-organizing maps. Clarify the expected 2D grid behavior, training process, and visualization-oriented output before implementation; the issue currently does not define concrete acceptance criteria for completion.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- machine-learning
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 30/100