Clustering Algorithm Based On Directed Graphs

Versión 1.2.1.2 (247 KB) por Warren Koontz
This function finds clusters in a data set using an algorithm by Koontz et al.
5.0
(2)
648 Descargas
Actualizado 1 ago 2018

Ver licencia

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 (2025). Clustering Algorithm Based On Directed Graphs (https://la.mathworks.com/matlabcentral/fileexchange/57320-clustering-algorithm-based-on-directed-graphs), MATLAB Central File Exchange. Recuperado .

Compatibilidad con la versión de MATLAB
Se creó con R2016a
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux
Categorías
Más información sobre Statistics and Machine Learning Toolbox en Help Center y MATLAB Answers.
Etiquetas Añadir etiquetas

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Versión Publicado Notas de la versión
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
A few minor changes
1.0.0.0