Clustering Algorithm Based On Directed Graphs

版本 1.2.1.2 (247.1 KB) 作者: Warren Koontz
This function finds clusters in a data set using an algorithm by Koontz et al.
5.0
(2)
648.0 次下载
更新时间 2018/8/1

查看许可证

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.

引用格式

Warren Koontz (2025). Clustering Algorithm Based On Directed Graphs (https://ww2.mathworks.cn/matlabcentral/fileexchange/57320-clustering-algorithm-based-on-directed-graphs), MATLAB Central File Exchange. 检索时间: .

MATLAB 版本兼容性
创建方式 R2016a
兼容任何版本
平台兼容性
Windows macOS Linux
类别
在 Help Center 和 MATLAB Answers 中查找有关 Statistics and Machine Learning Toolbox 的更多信息
标签 添加标签

Community Treasure Hunt

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

Start Hunting!

版本 已发布 发行说明
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