English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54487/89232 (61%)
Visitors : 10574874      Online Users : 42
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/52779


    Title: An Axis-Shifted Grid-Clustering Algorithm
    Authors: 張忠義;Chang, Chung-i;林丕靜;Lin, Nancy P.;詹念怡;Jan, Nien-yi
    Contributors: 淡江大學資訊工程學系
    Keywords: Data Mining;Grid-Based Clustering;Significant Cell;Grid Structure;Coordinate Axis
    Date: 2009-06-01
    Issue Date: 2010-12-01 10:30:14 (UTC+8)
    Publisher: 臺北縣:淡江大學
    Abstract: These spatial clustering methods can be classified into four categories: partitioning method, hierarchical method, density-based method and grid-based method. The grid-based clustering algorithm, which partitions the data space into a finite number of cells to form a grid structure and then performs all clustering operations to group similar spatial objects into classes on this obtained grid structure, is an efficient clustering algorithm. To cluster efficiently and simultaneously, to reduce the influences of the size and borders of the cells, a new grid-based clustering algorithm, an Axis-Shifted Grid-Clustering algorithm (ASGC), is proposed in this paper. This new clustering method combines a novel density-grid based clustering with axis-shifted partitioning strategy to identify areas of high density in the input data space. The main idea is to shift the original grid structure in each dimension of the data space after the clusters generated from this original structure have been obtained. The shifted grid structure can be considered as a dynamic adjustment of the size of the original cells and reduce the weakness of borders of cells. And thus, the clusters generated from this shifted grid structure can be used to revise the originally obtained clusters. The experimental results verify that, indeed, the effect of this new algorithm is less influenced by the size of cells than other grid-based ones and requires at most a single scan through the data.
    Relation: 淡江理工學刊=Tamkang journal of science and engineering 12(2),頁183-192
    DOI: 10.6180/jase.2009.12.2.10
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article
    [Office of Military Education and Training] Journal Article

    Files in This Item:

    File SizeFormat
    1560-6686_12-2-10.pdf4835KbAdobe PDF508View/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