淡江大學機構典藏:Item 987654321/46125
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62805/95882 (66%)
Visitors : 3946144      Online Users : 538
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: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/46125


    Title: A novel algorithm for data clustering
    Authors: 翁慶昌;Wong, Ching-chang;Chen, Chia-chong;Su, Mu-chun
    Contributors: 淡江大學電機工程學系
    Keywords: Data clustering;Unsupervised classification
    Date: 2001-02
    Issue Date: 2010-03-26 21:00:15 (UTC+8)
    Publisher: Elsevier
    Abstract: An efficient clustering algorithm is proposed in an unsupervised manner to cluster the given data set. This method is based on regulating a similarity measure and replacing movable vectors so that the appropriate clusters are determined by a performance for the classification validity. The proposed clustering algorithm needs not to predetermine the number of clusters, to choose the appropriate cluster centers in the initial step, and to choose a suitable similarity measure according to the shapes of the data. The location of the cluster centers can be efficiently determined and the data can be correctly classified by the proposed method. Several examples are considered to illustrate the effectiveness of the proposed method.
    Relation: Pattern Recognition 34(2), pp.425-442
    DOI: 10.1016/S0031-3203(00)00002-9
    Appears in Collections:[Graduate Institute & Department of Electrical Engineering] Journal Article

    Files in This Item:

    File SizeFormat
    0KbUnknown342View/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