期刊文献+

基于模糊聚类的高维划分策略研究 被引量:2

Splitting Strategy for High Dimensional Data Based on Fuzzy Clustering
下载PDF
导出
摘要 数据集的划分策略是影响高维数据库索引性能的一个关键因素。金字塔技术是一种较好的高维索引方法,但它只对均匀分布的数据集具有良好的性能。为此,提出了一种改进的基于模糊聚类的金字塔技术,并将其用于高维划分策略,先对数据集进行模糊聚类处理,然后针对每个聚类进行金字塔划分,从而较好地实现了对非均匀分布数据的高维划分。 The splitting strategy for high dimensional data set is important for the performance of the indexing of high - dimensional database. The pyramid technique is a good indexing method for high dimensional data, but it is only efficient for uniform data sets. In order to solve this problcm, an improved pyramid technique based on fuzzy clu sets at first, be available stering and th is put forward. This new strategy uses a certain en it applies pyramid technique on each cluster. only uniform data sets but also ununiform data fuzzy clustering scheme on the original data By this means, the pyramid technique can sets.
作者 蔡月 徐王伟
出处 《武汉理工大学学报(信息与管理工程版)》 CAS 2006年第1期7-10,共4页 Journal of Wuhan University of Technology:Information & Management Engineering
基金 教育部重点科技攻关资助项目(重点03120)
关键词 模糊聚类 高维 划分策略 fuzzy clustering high dimension splitting strategy
  • 相关文献

参考文献2

  • 1Cha G H. Bitmap Indexing Method for Complex Similarity Queries with Relevance Feedback[ A]. Chen SC,Shyu M L. Proceedings of the 1^st ACM International Workshop on Multimedia Databases[ C]. New York:ACM Press ,2003.55 - 62.
  • 2Berchtold S, Bohm C, Kriegel H P. The Pyramid Technique:Towards Breaking the Curse of Dimensionality[ A ]. Laura M H, Tiwary A. Proceedings of the International Conference on Management of Data [ C ]. New York : ACM Press, 1998. 142 - 153.

同被引文献7

  • 1BERCHTOLD S , BOHM C , KRIEGAL H- P. The pyramid- technique: towards breaking the curse of dimensionality [ J]. ACM, 1998, 27(2) : 142 - 153.
  • 2LUKASZUK J, ORLANDIC R. On accessing data in high-dimensional spaces: A comparative study of three space partitioning strategies[ J]. Journal of Systems and Software, 2004, 73(1) : 147 - 157.
  • 3ORLANDIC R, LAI Y, YEE W G. Clustering high-dimensional data using an efficient and effective data space reduction[ C]// Proceedings of ACM Conference on Information and Knowledge Management CIKM'05. New York, NY, USA: ACM, 2005:201-208.
  • 4LAI Y, ORLANDIC R, YEE W G. Scalable clustering for large high-dimensional data based on data summarization [ C]// IEEE Symposium on Computational Intelligence and Data Mining. Washington, DC: IEEE Computer Society, 2007:456-461.
  • 5ZHOU HONGFANG , FENG BOQIN , LV LINTAO . A robust algorithm for subspace clustering of high-dimensional data[ J]. Information Technology Journal. 2007, 6(2):255 -258.
  • 6ROLANDIC R. Effective management of hierarchical storage using two levels of data clustering[ C]// Proceedings of 20th IEEF/11th NASA Goddard Conference on Mass Storage Systems and Technology. Washington, DC: IEEE Computer Society, 2003:270-279.
  • 7张海勤,欧阳为民,蔡庆生.聚类金字塔树:一种新的高维空间数据索引方法[J].中国科学技术大学学报,2001,31(6):707-713. 被引量:8

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部