Robust Clustering for Longitudinal Data with Fast Computational Algorithm
碩士 === 國立中興大學 === 統計學研究所 === 105 === This study introduces noncentrality and its variant as a measure for clustering longitudinal data,along with an improvement on the computational algorithm:the iterated recombination of subsets(IRS).Since the IRS algorithm still has considerable burden in computat...
Main Authors: | Jun-Kai Ke, 柯竣凱 |
---|---|
Other Authors: | Hong-Dar Wu |
Format: | Others |
Language: | zh-TW |
Published: |
2017
|
Online Access: | http://ndltd.ncl.edu.tw/handle/92183938012897774786 |
Similar Items
-
Fast, Robust and Scalable Clustering Algorithms with Applications in Computer Vision
by: Petrosyan, Vahan
Published: (2018) -
Fast Clustering Algorithms for Compact Data
by: Tsung-Jen Huang, et al.
Published: (2011) -
genieclust: Fast and robust hierarchical clustering
by: Marek Gagolewski
Published: (2021-07-01) -
Density-based clustering algorithm for GPGPU computing
by: Kai-Shiang Chang, et al.
Published: (2016) -
Robust clustering algorithms
by: Gupta, Pramod
Published: (2011)