Chia Nan University of Pharmacy & Science Institutional Repository:Item 310902800/29602
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 17744/20032 (89%)
Visitors : 7235782      Online Users : 353
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://ir.cnu.edu.tw/handle/310902800/29602


    Title: A fast particle swarm optimization for clustering
    Authors: Tsai, Chun-Wei
    Huang, Ko-Wei
    Yang, Chu-Sing
    Chiang, Ming-Chao
    Contributors: 資訊多媒體應用系
    Keywords: Clustering
    Particle swarm optimization
    Pattern reduction
    Date: 2015-02
    Issue Date: 2016-04-19 19:01:40 (UTC+8)
    Publisher: Springer
    Abstract: This paper presents a high-performance method to reduce the time complexity of particle swarm optimization (PSO) and its variants in solving the partitional clustering problem. The proposed method works by adding two additional operators to the PSO-based algorithms. The pattern reduction operator is aimed to reduce the computation time, by compressing at each iteration patterns that are unlikely to change the clusters to which they belong thereafter while the multistart operator is aimed to improve the quality of the clustering result, by enforcing the diversity of the population to prevent the proposed method from getting stuck in local optima. To evaluate the performance of the proposed method, we compare it with several state-of-the-art PSO-based methods in solving data clustering, image clustering, and codebook generation problems. Our simulation results indicate that not only can the proposed method significantly reduce the computation time of PSO-based algorithms, but it can also provide a clustering result that matches or outperforms the result PSO-based algorithms by themselves can provide.
    Relation: Soft Computing, v.19 n.2, pp.321-338
    Appears in Collections:[Dept. of Applide Informatics & Multimedia] Periodical Articles

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML590View/Open


    All items in CNU IR are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback