Clustering Algorithm Based On Directed Graphs
This function finds clusters in a data set using an algorithm by Koontz et al.
Sie verfolgen jetzt diese Einreichung
- Aktualisierungen können Sie in Ihrem Feed verfolgter Inhalte sehen.
- Je nach Ihren Kommunikationseinstellungen können Sie auch E-Mails erhalten.
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.
Zitieren als
Warren Koontz (2026). Clustering Algorithm Based On Directed Graphs (https://de.mathworks.com/matlabcentral/fileexchange/57320-clustering-algorithm-based-on-directed-graphs), MATLAB Central File Exchange. Abgerufen .
Kategorien
Mehr zu Statistics and Machine Learning Toolbox finden Sie in Help Center und MATLAB Answers
Allgemeine Informationen
- Version 1.2.1.2 (247 KB)
Kompatibilität der MATLAB-Version
- Kompatibel mit allen Versionen
Plattform-Kompatibilität
- Windows
- macOS
- Linux
| Version | Veröffentlicht | Versionshinweise | Action |
|---|---|---|---|
| 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 |
