English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49521/84657 (58%)
Visitors : 7594568      Online Users : 75
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/95896


    Title: K-Means Algorithm Based on Particle Swarm Optimization
    Authors: Chen, Ching-Yi;Ye, Fun
    Contributors: 淡江大學電機工程學系
    Keywords: Clustering analysis;Particle swarm optimization;K-means
    Date: 2003-12
    Issue Date: 2014-02-13 11:17:55 (UTC+8)
    Abstract: Clustering analysis aims at discovering groups and identifying interesting distributions and patterns in data sets. It can help the user to distinguish the structure of data and simplify the complexity of data from mass information. A particle swarm optimization-based clustering technique that utilized the principles of K-means algorithm, called KPSO-clustering, is proposed in this article. We attempt to integrate the effectiveness of the K-means algorithm for partitioning data into a number of clusters, with the capability of PSO to bring it out of the local minima. Finally, the effectiveness of the KPSO-clustering is demonstrated on four artificial data sets.
    Relation: Proceedings of 2003 International Conference on Informations, Cybernetics, and Systems,頁1470-1475
    Appears in Collections:[電機工程學系暨研究所] 會議論文

    Files in This Item:

    File SizeFormat
    K-Means Algorithm Based on Particle Swarm Optimization_英文摘要.docx20KbMicrosoft Word126View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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