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: | Hong-Chung Lee, 李鴻聰 |
---|---|
Other Authors: | Chin-Wen Ho |
Format: | Others |
Language: | en_US |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/21723950847923173017 |
Similar Items
-
Experimental study of minimum cut algorithms
by: Levine, Matthew S. (Matthew Steven)
Published: (2008) -
A branch-and-cut SDP-based algorithm for minimum sum-of-squares clustering
by: Daniel Aloise, et al.
Published: (2009-12-01) -
CciMST: A Clustering Algorithm Based on Minimum Spanning Tree and Cluster Centers
by: Xiaobo Lv, et al.
Published: (2018-01-01) -
Double-Valued Neutrosophic Sets, their Minimum Spanning Trees, and Clustering Algorithm
by: Kandasamy Ilanthenral
Published: (2018-03-01) -
An Anti-Noise Process Mining Algorithm Based on Minimum Spanning Tree Clustering
by: Weimin Li, et al.
Published: (2018-01-01)