中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/109253
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94274/94274 (100%)
Visitors : 82911077      Online Users : 2209
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: https://ir.lib.ncu.edu.tw/handle/987654321/109253


    Title: On mean shift-based clustering for circular data
    Authors: 洪文良;Chang-Chien, Shou-Jen;Hung, Wen-Liang;Yang, Miin-Shen
    Contributors: 理學院數學系
    Keywords: Algorithms;Artificial Intelligence;Blurring;Cluster analysis;Clustering;Computational Intelligence;Control;Data analysis;Data points;Datasets;Engineering;Mathematical Logic and Foundations;Mechatronics;Methods;Missing data;Original Paper;Probability;Robotics
    Date: 2012-06-01
    Issue Date: 2026-04-23 16:18:40 (UTC+8)
    Publisher: Springer Verlag;Berlin/Heidelberg: Springer-Verlag
    Abstract: 摘要: Cluster analysis is a useful tool for data analysis. Clustering methods are used to partition a data set into clusters such that the data points in the same cluster are the most similar to each other and the data points in the different clusters are the most dissimilar. The mean shift was originally used as a kernel-type weighted mean procedure that had been proposed as a clustering algorithm. However, most mean shift-based clustering (MSBC) algorithms are used for numeric data. The circular data that are the directional data on the plane have been widely used in data analysis. In this paper, we propose a MSBC algorithm for circular data. Three types of mean shift implementation procedures with nonblurring, blurring and general methods are furthermore compared in which the blurring mean shift procedure is the best and recommended. The proposed MSBC for circular data is not necessary to give the number of cluster. It can automatically find a final cluster number with good clustering centers. Several numerical examples and comparisons with some existing clustering methods are used to demonstrate its effectiveness and superiority of the proposed method.
    其他題名: Soft Comput
    出版者: Berlin/Heidelberg: Springer-Verlag
    出版日期: 2012-06
    出處: Soft computing (Berlin, Germany), 2012-06, Vol.16 (6), p.1043-1060
    版權: Springer-Verlag 2012
    版權: Springer-Verlag 2012.
    識別號: ISSN: 1432-7643
    識別號: EISSN: 1433-7479
    識別號: DOI: 10.1007/s00500-012-0802-z
    Appears in Collections:[Department of Mathematics] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML19View/Open


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

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明