跳到主要导航 跳到搜索 跳到主要内容

SS/OSF for high-dimensional sparse data object clustering

  • Ping Wu*
  • , Han Tao Song
  • , Zhen Dong Niu
  • , Li Ping Zhang
  • , Ju Li Zhang
  • *此作品的通讯作者
  • Beijing Institute of Technology
  • Lanzhou University of Technology

科研成果: 期刊稿件文章同行评审

摘要

Results of clustering are generally not ideal with traditional clustering method. Thus a SS/OSF clustering method is proposed for high-dimensional sparse data object based on set similarity (SS) and object set feature (OSF) with the addability of object set features. After the object clusters are gained by the SS/OSF clustering method, and according to the supremum and infimum of object clustering set, the new object can be distributed to all kinds of different clusters. Compared with the traditional K-means clustering method, the test results show that, as the number of object increases, the runtime and precision of results of the SS/OSF clustering method are seen to be clearly improved.

源语言英语
页(从-至)216-220
页数5
期刊Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology
26
3
出版状态已出版 - 3月 2006

学术指纹

探究 'SS/OSF for high-dimensional sparse data object clustering' 的科研主题。它们共同构成独一无二的学术指纹。

引用此