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)
다운로드 수: 639
업데이트 날짜: 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 (2024). Clustering Algorithm Based On Directed Graphs (https://www.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에 대해 자세히 알아보기
태그 태그 추가

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