Fast Clustering Algorithms for Compact Data
博士 === 國立臺灣海洋大學 === 資訊工程學系 === 100 === In this dissertation, three types of algorithms: partition-based clustering, hierarchical divisive clustering and hierarchical agglomerative clustering, are developed to speed up clustering for compact data. These methods exploit the relationships between data...
Main Authors: | Tsung-Jen Huang, 黃崇仁 |
---|---|
Other Authors: | Jim Z. C., Lai |
Format: | Others |
Language: | en_US |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/81593670983905576013 |
Similar Items
-
Fast Density Clustering Algorithm for Numerical Data and Categorical Data
by: Chen Jinyin, et al.
Published: (2017-01-01) -
Robust Clustering for Longitudinal Data with Fast Computational Algorithm
by: Jun-Kai Ke, et al.
Published: (2017) -
A Fast Iris Segmentation Algorithm based on Faster R-CNN
by: Po-Jen Huang, et al.
Published: (2018) -
A Fast Clustering Algorithm for Data with a Few Labeled Instances
by: Jinfeng Yang, et al.
Published: (2015-01-01) -
Fast Filterbank and Efficient Compaction Algorithms for Audio Coding Systems
by: Din-Yuen Chan, et al.
Published: (1996)