Additional speed-up technique to fuzzy clustering using a multiresolution approach

被引:3
|
作者
Buerki, M [1 ]
Oswald, H [1 ]
Lovblad, KO [1 ]
Schroth, G [1 ]
机构
[1] Univ Hosp Bern, Dept Neuroradiol, CH-3010 Bern, Switzerland
关键词
functional ME; fuzzy clustering; multi-resolution;
D O I
10.1117/12.430989
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The fuzzy clustering algorithm (FCA) is a powerful tool for unsupervised investigation of complex data in functional ME. The original, computationally very expensive algorithm has been adapted in various ways to increase its performance while keeping it stable and sensitive. A simple and highly efficient way to speed up the FCA is preselection (screening) of potentially interesting time-courses, in a way that those time-courses, where only noise is expected are discarded. Although quite successful, preselecting data by some criterion is a step back to model driven analysis and should therefore be used with deliberation. Furthermore, some screening methods run the risk of missing non-periodic signals. We propose an additional adaptation using a multi-resolution approach that first scales down the data volumes. Starting with the lowest resolution, the FCA is applied to that level and then, the computed centroids are used as initial values to the FCA for the next higher level of resolution and so on until the original resolution is reached. The processing of all lower resolution levels serves as a good and fast initialization of the FCA, resulting in a stable convergence and an improved performance without loss of information.
引用
收藏
页码:1141 / 1150
页数:4
相关论文
共 50 条
  • [1] A hybrid approach to speed-up the k-means clustering method
    T. Hitendra Sarma
    P. Viswanath
    B. Eswara Reddy
    [J]. International Journal of Machine Learning and Cybernetics, 2013, 4 : 107 - 117
  • [2] A hybrid approach to speed-up the k-means clustering method
    Sarma, T. Hitendra
    Viswanath, P.
    Reddy, B. Eswara
    [J]. INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2013, 4 (02) : 107 - 117
  • [3] Timing analysis speed-up using a hierarchical and a multimode approach
    Blaquiere, Y
    Dagenais, M
    Savaria, Y
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1996, 15 (02) : 244 - 255
  • [4] Speed-up fractal image compression with a fuzzy classifier
    Loe, KF
    Gu, WG
    Phua, KH
    [J]. SIGNAL PROCESSING-IMAGE COMMUNICATION, 1997, 10 (04) : 303 - 311
  • [5] A very-high-speed ATM switch architecture using internal speed-up technique
    Genda, K
    Doi, Y
    Endo, K
    Yamanaka, N
    [J]. NTT REVIEW, 1997, 9 (02): : 20 - 27
  • [6] A Speed-Up Technique for Distributed Shortest Paths Computation
    D'Angelo, Gianlorenzo
    D'Emidio, Mattia
    Frigioni, Daniele
    Maurizio, Vinicio
    [J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2011, PT II, 2011, 6783 : 578 - 593
  • [7] Using Dynamic Parallelism to Speed-Up Clustering-Based Community Detection in Social Networks
    Alandoli, Mohammed
    Al-Ayyoub, Mahmoud
    Al-Smadi, Mohammad
    Jararweh, Yaser
    Benkhelifa, Elhadj
    [J]. 2016 IEEE 4TH INTERNATIONAL CONFERENCE ON FUTURE INTERNET OF THINGS AND CLOUD WORKSHOPS (FICLOUDW), 2016, : 240 - 245
  • [8] Domain clustering for inter-domain path computation speed-up
    Maggi, Lorenzo
    Leguay, Jeremie
    Cohen, Johanne
    Medagliani, Paolo
    [J]. NETWORKS, 2018, 71 (03) : 252 - 270
  • [9] A Speed-Up Hierarchical Compact Clustering Algorithm for Dynamic Document Collections
    Gil-Garcia, Reynaldo
    Pons-Porrata, Aurora
    [J]. PROGRESS IN PATTERN RECOGNITION, IMAGE ANALYSIS, COMPUTER VISION, AND APPLICATIONS, PROCEEDINGS, 2009, 5856 : 379 - 386
  • [10] Speed-up for the expectation-maximization algorithm for clustering categorical data
    Jollois, F. -X.
    Nadif, M.
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2007, 37 (04) : 513 - 525