Clustering Algorithm Based On Directed Graphs
This function finds clusters in a data set using an algorithm by Koontz et al.
Ahora está siguiendo esta publicación
- Verá actualizaciones en las notificaciones de contenido en seguimiento.
- Podrá recibir correos electrónicos, en función de las preferencias de comunicación que haya establecido.
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.
Citar como
Warren Koontz (2026). Clustering Algorithm Based On Directed Graphs (https://la.mathworks.com/matlabcentral/fileexchange/57320-clustering-algorithm-based-on-directed-graphs), MATLAB Central File Exchange. Recuperado .
Categorías
Más información sobre Statistics and Machine Learning Toolbox en Help Center y MATLAB Answers.
Información general
- Versión 1.2.1.2 (247 KB)
Compatibilidad con la versión de MATLAB
- Compatible con cualquier versión
Compatibilidad con las plataformas
- Windows
- macOS
- Linux
| Versión | Publicado | Notas de la versión | 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 |
