Clustering Algorithm Based On Directed Graphs
The algorithm organizes a set of N objects into a directed graph that reveals clusters of
objects. Specically, the algorithm chooses a parent object for each object. The parent
object is also one of the objects in the set and may be the object itself. This parenthood
can be stated as a mapping P(n) of the object indexes into themselves. An object that is
its own parent is an orphan and becomes the root of a cluster.
Further information is provided in an accompanying document.
Cite As
Warren Koontz (2024). Clustering Algorithm Based On Directed Graphs (https://www.mathworks.com/matlabcentral/fileexchange/57320-clustering-algorithm-based-on-directed-graphs), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
- AI, Data Science, and Statistics > Statistics and Machine Learning Toolbox >
- MATLAB > Mathematics > Graph and Network Algorithms > Construction > Directed Graphs >
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.2.1.2 | Simplified code by making more use of graph object methods. |
||
1.2.1.1 | Simplified code by making more use of graph object methods. |
||
1.2.1.0 | Now finds parents and orphans in same loop |
||
1.2.0.0 | Bug fix to avoid omitting isolated objects from graph structure. |
||
1.1.0.0 | Minor changes
|
||
1.0.0.0 |