Clustering Algorithm Based On Directed Graphs

バージョン 1.2.1.2 (247 KB) 作成者: Warren Koontz
This function finds clusters in a data set using an algorithm by Koontz et al.
5.0
(2)
ダウンロード: 649
更新 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 (2026). Clustering Algorithm Based On Directed Graphs (https://jp.mathworks.com/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 についてさらに検索
タグ タグを追加

バージョン 公開済み リリース ノート
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