Clustering Function Based on K Nearest Neighbors
This function is similar to the graph theoretic clustering function that I submitted previously (https://www.mathworks.com/matlabcentral/fileexchange/57320-clustering-algorithm-based-on-directed-graphs). The input is an observation/attribute matrix and an integer K that specifies the number of nearest neighbors for each observation. The algorithm first finds the K nearest neighbors of each observation and then a parent for each observation. The parent is the observation among the K+1 whose Kth nearest neighbor is the nearest (check the code for a more precise specification). As in the previous function, orphans become the roots of clusters and the remaining nodes are assigned recursively to the cluster of their parent.
Cite As
Warren Koontz (2024). Clustering Function Based on K Nearest Neighbors (https://www.mathworks.com/matlabcentral/fileexchange/68778-clustering-function-based-on-k-nearest-neighbors), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Version | Published | Release Notes | |
---|---|---|---|
1.0.0 |