Clustering Algorithm Based On Directed Graphs

This function finds clusters in a data set using an algorithm by Koontz et al.

バージョン 1.2.1.2 (247 KB)
ダウンロード: 651 件
(2)
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. に取得済み.

カテゴリ

Help Center および MATLAB Answers で Statistics and Machine Learning Toolbox についてさらに検索

一般的な情報

MATLAB リリースの互換性

  • すべてのリリースと互換性あり

プラットフォームの互換性

  • Windows
  • macOS
  • Linux
新しいタブで開く
バージョン 公開済み リリース ノート
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