A Study on Extreme Conditions of Minimum Cut Tree Clustering Algorithm
碩士 === 國立中央大學 === 資訊工程研究所 === 92 === Clustering algorithms are effective tools for exploring the structure of complex data sets. There are a lot of applications for clustering algorithms, including bioinformatics, image recognition, business transactions, etc. The minimum cut tree clustering algorit...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/21723950847923173017 |
| Summary: | 碩士 === 國立中央大學 === 資訊工程研究所 === 92 === Clustering algorithms are effective tools for exploring the structure of complex data sets. There are a lot of applications for clustering algorithms, including bioinformatics, image recognition, business transactions, etc.
The minimum cut tree clustering algorithm is using maximum flow techniques to cluster the data (graphs). We prove that two kinds of graph, i.e. graph with edge connectivity and a graph with a vertex connected to every other vertex, are the extreme conditions in the algorithm.
|
|---|