English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 94188/124659 (76%)
Visitors : 29643893      Online Users : 441
RC Version 6.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
    政大機構典藏 > 商學院 > 統計學系 > 專書/專書篇章 >  Item 140.119/130051
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/130051

    Title: A New Clustering Algorithm Based on Graph Connectivity
    Authors: 洪英超
    Hung, Y.C.
    Li, Y.F.
    Lu, L.H.
    Contributors: 統計系
    Keywords: Clustering;Graph theory;Time complexity
    Date: 2018-11
    Issue Date: 2020-05-28 11:33:20 (UTC+8)
    Abstract: A new clustering algorithm based on the concept of graph connectivity is introduced. The idea is to develop a meaningful graph representation for data, where each resulting sub-graph corresponds to a cluster with highly similar objects connected by edge. The proposed algorithm has a fairly strong theoretical basis that supports its originality and computational efficiency. Further, some useful guidelines are provided so that the algorithm can be tuned to optimize the well-designed quality indices. Numerical evidences show that the proposed algorithm can provide a very good clustering accuracy for a number of benchmark data and has a relatively low computational complexity compared to some sophisticated clustering methods.
    Relation: Advances in Intelligent Systems and Computing, Springer, pp.442-454
    Data Type: book
    DOI 連結: https://doi.org/10.1007/978-3-030-01174-1_33
    DOI: 10.1007/978-3-030-01174-1_33
    Appears in Collections:[統計學系] 專書/專書篇章

    Files in This Item:

    File SizeFormat
    453.pdf2733KbAdobe PDF29View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

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