首页 | 本学科首页   官方微博 | 高级检索  
     检索      

PP K-MEAN CLUSTERING
作者姓名:ZHANG Dixin  ZHU Lixing Guizhou Planning College  Guiyang  China Institute of Applied Mathematics  Academia Sinica  Beijing  China
作者单位:ZHANG Dixin;ZHU Lixing Guizhou Planning College,Guiyang 550001,China Institute of Applied Mathematics,Academia Sinica,Beijing 100080,China
基金项目:This work is partly supported by the National Natural Science Foundation of China.
摘    要:In this paper, we propose a dimension-reducing, K-mean clustering procedureby Projection Pursuit (PP) technique so as to explore the clustering structure of data inhigh-dimensional space in terms of low-dimensional projective points of data, and we obtainthe a.s. consistence of the estimates of the cluster centers and projection orientations.


PP K-MEAN CLUSTERING
ZHANG Dixin,ZHU Lixing Guizhou Planning College,Guiyang ,China Institute of Applied Mathematics,Academia Sinica,Beijing ,China.PP K-MEAN CLUSTERING[J].Journal of Systems Science and Complexity,1993(4).
Authors:ZHANG Dixin  ZHU Lixing Guizhou Planning College  Guiyang  China Institute of Applied Mathematics  Academia Sinica  Beijing  China
Institution:ZHANG Dixin,ZHU Lixing Guizhou Planning College,Guiyang 550001,China Institute of Applied Mathematics,Academia Sinica,Beijing 100080,China
Abstract:In this paper, we propose a dimension-reducing, K-mean clustering procedure by Projection Pursuit (PP) technique so as to explore the clustering structure of data in high-dimensional space in terms of low-dimensional projective points of data, and we obtain the a.s. consistence of the estimates of the cluster centers and projection orientations.
Keywords:Projection pursuit  K-mean clustering  a  s  consistence
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号