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...

Full description

Bibliographic Details
Main Authors:	Hong-Chung Lee, 李鴻聰
Other Authors:	Chin-Wen Ho
Format:	Others
Language:	en_US
Published:	2003
Online Access:	http://ndltd.ncl.edu.tw/handle/21723950847923173017

id	ndltd-TW-092NCU05392005
record_format	oai_dc
spelling	ndltd-TW-092NCU053920052015-10-13T13:04:43Z http://ndltd.ncl.edu.tw/handle/21723950847923173017 A Study on Extreme Conditions of Minimum Cut Tree Clustering Algorithm 最小切割樹群聚演算法極端情形之研究 Hong-Chung Lee 李鴻聰碩士國立中央大學資訊工程研究所 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. Chin-Wen Ho 何錦文 2003 學位論文 ; thesis 31 en_US
collection	NDLTD
language	en_US
format	Others
sources	NDLTD
description	碩士 === 國立中央大學 === 資訊工程研究所 === 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.
author2	Chin-Wen Ho
author_facet	Chin-Wen Ho Hong-Chung Lee 李鴻聰
author	Hong-Chung Lee 李鴻聰
spellingShingle	Hong-Chung Lee 李鴻聰 A Study on Extreme Conditions of Minimum Cut Tree Clustering Algorithm
author_sort	Hong-Chung Lee
title	A Study on Extreme Conditions of Minimum Cut Tree Clustering Algorithm
title_short	A Study on Extreme Conditions of Minimum Cut Tree Clustering Algorithm
title_full	A Study on Extreme Conditions of Minimum Cut Tree Clustering Algorithm
title_fullStr	A Study on Extreme Conditions of Minimum Cut Tree Clustering Algorithm
title_full_unstemmed	A Study on Extreme Conditions of Minimum Cut Tree Clustering Algorithm
title_sort	study on extreme conditions of minimum cut tree clustering algorithm
publishDate	2003
url	http://ndltd.ncl.edu.tw/handle/21723950847923173017
work_keys_str_mv	AT hongchunglee astudyonextremeconditionsofminimumcuttreeclusteringalgorithm AT lǐhóngcōng astudyonextremeconditionsofminimumcuttreeclusteringalgorithm AT hongchunglee zuìxiǎoqiègēshùqúnjùyǎnsuànfǎjíduānqíngxíngzhīyánjiū AT lǐhóngcōng zuìxiǎoqiègēshùqúnjùyǎnsuànfǎjíduānqíngxíngzhīyánjiū AT hongchunglee studyonextremeconditionsofminimumcuttreeclusteringalgorithm AT lǐhóngcōng studyonextremeconditionsofminimumcuttreeclusteringalgorithm
_version_	1717730849235927040

A Study on Extreme Conditions of Minimum Cut Tree Clustering Algorithm

Similar Items