期刊文献+

一种基于随机抽取的有限深度层次聚类

A Hierarchical Clustering Algorithm Based on Random Sampling and Limited Depth
下载PDF
导出
摘要 聚类是数据挖掘中的关键问题,吸取了BIRCH算法中构造簇特征树来产生初始聚类中心的方法,提出了一种基于随机抽取的有限深度层次聚类算法(RSLDCH算法),采用随机抽取样本、限制特征树深度、构建叶子节点链表技术从而提高了算法的时间效率和聚类效果.实验表明,RSLDCH较BIRCH在运行速度和聚类效果上有一定的提高. Clustering is a key problem in data mining.A hierarchical clustering algorithm is proposed based on random sampling and limited depth,which absorbs the method BIRCH algorithm used constructing a clustering feature tree to induce a group of initial clustering centers.Simultaneously,the algorithm employs the technologies of random sampling,limiting the depth of the clustering feature tree and creating leaf node link to improve the temporal efficiency and the result of clustering.Experiments show that RSLDCH o...
出处 《郑州大学学报(理学版)》 CAS 2007年第3期80-83,共4页 Journal of Zhengzhou University:Natural Science Edition
关键词 层次聚类 BIRCH算法 CF CFT RSLDCH算法 hierarchical clustering BIRCH algorithm clustering feature clustering feature tree RSLDCH algorithm
  • 相关文献

参考文献8

  • 1刘泉凤,陆蓓.数据挖掘中聚类算法的比较研究[J].浙江水利水电专科学校学报,2005,17(2):55-58. 被引量:9
  • 2[2]Raymond T,Hau N J.Efficient and effective clustering methods for spatial data mining[C]// The 20th VLDB Conference.Santiago,1994:144-155.
  • 3周兵,沈钧毅,彭勤科.基于随机抽样和聚类特征的聚类算法[J].西安交通大学学报,2003,37(12):1234-1237. 被引量:6
  • 4[4]Zhang T,Ramakrishnan R,Livny M.BIRCH:an efficient data clustering method for very large databases[C]//The ACM SIGMOD Conference on Management of Data.Montreal,Canada,1996:103-114.
  • 5李雯睿,白晨希.一种本体学习模型的设计与实现[J].河南大学学报(自然科学版),2006,36(4):100-102. 被引量:4
  • 6王建会,申展,胡运发.一种实用高效的聚类算法[J].软件学报,2004,15(5):697-705. 被引量:26
  • 7[7]Ester M,Kriegel H P,Sander J,et al.A density-based algorithm for discovering clusters in large spatial database with noise[C]//2nd Int'l Conf on Knowledge Discovering in Databases and Data Mining.Portland,USA,1996:226-231.
  • 8[8]Yang Jianwu,Chen Xiaoou,A semi-structured document model for text mining[J].Journal of Computer Science and Technology,2002,17(5):603-610.

二级参考文献19

  • 1[1]Raymond T, Hau N J. Efficient and effective clustering methods for spatial data mining[A]. The 20th VLDB Conference, Santiago, Chile, 1994.
  • 2[2]Zhang T, Ramakrishnan R, Livny M. BIRCH: an efficient data clustering method for very large databases[A]. The ACM SIGMOD Conference on Management of Data, Montreal, Canada, 1996.
  • 3[3]Ester M, Kriegel H P, Sander J, et al. A densitybased algorithm for discovering clusters in large spatial database with noise [A]. 2nd Intl Conf on Knowledge Discovering in Databases and Data Mining, Portland,USA, 1996.
  • 4[4]Guha U,Rastogi R, Shim K. CURE.. an efficient clustering algorithm for large databases [J]. Pergamon Information Systems, 2001, 26(1): 35~58.
  • 5[5]Wang Wei, Yang Jiong, Muntz R. STING: a statistical information grid approach to spatial data mining[A]. The 23rd VLDB Conference, Athens, Greece,1997.
  • 6[6]Gehrke A J, Gunopulos D, Raghavan P. Automatic subspace clustering of high dimensional data for data mining applications [A]. The ACM SIGMOD International Conference on Management of Data, Seattle,USA, 1998.
  • 7[7]Vitter J. Random sampling with reservoir [J]. ACM Trans on Mathematical Software, 1985, 11 (1): 37 ~57.
  • 8[8]Motwani R, Raghavan P. Randomized algorithms [M]. London: Cambridge University Press, 1995.
  • 9Berners-Lee T, Hendler J, Lassila O. The Semantic Web [J]. Scientific American, 2001,284(5):34-43.
  • 10Borst W N. Construction of Engineering Ontologies for Knowledge Sharing and Reuse [D]. Enschede: University of Twente, 1997: 56-71.

共引文献41

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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