• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Xie Kunwu, Bi Xiaoling, and Ye Bin. Clustering Algorithm of High-Dimensional Data Based on Units[J]. Journal of Computer Research and Development, 2007, 44(9): 1618-1623.
Citation: Xie Kunwu, Bi Xiaoling, and Ye Bin. Clustering Algorithm of High-Dimensional Data Based on Units[J]. Journal of Computer Research and Development, 2007, 44(9): 1618-1623.

Clustering Algorithm of High-Dimensional Data Based on Units

More Information
  • Published Date: September 14, 2007
  • Clustering is a data mining problem that has received significant attention from the database community. Data set size, dimensionality and sparsity have been identified as aspects that make clustering more difficult. Clustering in high-dimensional spaces is a difficult problem which is recurrent in many domains, for example, in image analysis. High dimension according to higher spatial dimension, data point distribution sparsity, and average density, therefore, discover the data gathering the kind quite to be difficult. The bottleneck of distance-based methods in clustering high-dimensional data sets is calculating the distance between data points. At present the research technique mainly concentrates on the density method based on the grid method and the characteristic method, and this research usually lies in making the improved data to gather with emphasis on the kind of process performance, including obtaining accurately gathering a kind of center, removing noise and so on. Instead of distance calculation, CAHD (clustering algorithm high-dimensional data) searches the dense units in n-dimension space and subspace from both bottom-up and top-down directions in the meantime, and then it clusters these dense units by using bitwise AND. The search strategy reduces search space to improve efficiency and the only use of bitwise and bit-shift machine instructions in clustering makes the algorithm more efficient. The algorithm CAHD is proposed for high-dimensional data sets. Experiments based on the data set indicate that the algorithm has very good validity.
  • Related Articles

    [1]Li Xiaoping, Zhou Zhixing, Chen Long, Zhu Jie. Task Offloading and Cooperative Scheduling for Heterogeneous Edge Resources[J]. Journal of Computer Research and Development, 2023, 60(6): 1296-1307. DOI: 10.7544/issn1000-1239.202110936
    [2]Tang Xuhao, Liu Fagui, Wang Bin, Li Chao, Jiang Jun, Tang Quan, Chen Weiming, He Fengwen. Survey on Task Scheduling in Inter-Cloud Environment[J]. Journal of Computer Research and Development, 2023, 60(6): 1262-1275. DOI: 10.7544/issn1000-1239.202220021
    [3]Wang Yawen, Guo Yunfei, Liu Wenyan, Hu Hongchao, Huo Shumin, Cheng Guozhen. A Task Scheduling Method for Cloud Workflow Security[J]. Journal of Computer Research and Development, 2018, 55(6): 1180-1189. DOI: 10.7544/issn1000-1239.2018.20170425
    [4]Hu Haiyang, Liu Runhua, Hu Hua. Multi-Objective Optimization for Task Scheduling in Mobile Cloud Computing[J]. Journal of Computer Research and Development, 2017, 54(9): 1909-1919. DOI: 10.7544/issn1000-1239.2017.20160757
    [5]Li Xuejun, Xu Jia, Zhu Erzhou, Zhang Yiwen. A Novel Computation Method for Adaptive Inertia Weight of Task Scheduling Algorithm[J]. Journal of Computer Research and Development, 2016, 53(9): 1990-1999. DOI: 10.7544/issn1000-1239.2016.20151175
    [6]Wang Qiang, Li Xiongfei, Wang Jing. A Data Placement and Task Scheduling Algorithm in Cloud Computing[J]. Journal of Computer Research and Development, 2014, 51(11): 2416-2426. DOI: 10.7544/issn1000-1239.2014.20130749
    [7]Yu Guoliang, Wu Weiguo, Yang Zhihua, Qian Depei. A Boundary-Table-Based Algorithm for Reconfigurable Resource Management and Hardware Task Scheduling[J]. Journal of Computer Research and Development, 2011, 48(4): 699-708.
    [8]Wu Lei and Du Zhihui. A Dynamic Knowledge-Based Task Scheduling Algorithm in Simulation Grid Environment[J]. Journal of Computer Research and Development, 2008, 45(2): 261-268.
    [9]Chen Tingwei, Zhang Bin, and Hao Xianwen. Dependent Task Scheduling in Grid Based on T-RAG Optimization Selection[J]. Journal of Computer Research and Development, 2007, 44(10): 1741-1750.
    [10]Li Qinghua, Han Jianjun, Abbas A. Essa. A Fast and Effective Static Task Scheduling Algorithm in Homogeneous Computing Environments[J]. Journal of Computer Research and Development, 2005, 42(1): 118-125.

Catalog

    Article views (699) PDF downloads (499) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return