期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

对一种基于划分的聚类算法CLARANS的改进 被引量：1

he Improvement Based on CLARANS-a Divided Clustering Algorithm
下载PDF
导出
摘要 通过设计两种将原始空间转化为平滑空间的方法:等距法(Equal Distance)和加噪法(Add Noise),结合CLARANS算法对原有CLARANS算法进行改进,得到更好的聚类结果。 Through the design of the two kinds of methods that converting the original space into a smooth space： to Equal Distance and to add Noise. combined with algorithm CLARANS, combine the CLARANS, the original algorithm CLARANS is improved and better clustering results are also given.
作者 王宁 王浩
机构地区 合肥工业大学 皖西学院
出处 《皖西学院学报》 2009年第2期26-29,共4页 Journal of West Anhui University
基金 皖西学院自然科学研究项目"科研管理信息系统的研究与开发"(WXZQ0705) 安徽高等学校省级自然科学研究项目"基于XML的WEB文本数据挖掘研究"(KJ2009B126) 安徽高等学校省级自然科学研究项目"基于内容的数字视频检索关键技术研究"(KJ2009A54)
关键词 聚类 平滑空间 clustering smooth space
分类号 TP274.2 [自动化与计算机技术—检测技术与自动化装置]
  • 相关文献

参考文献13

  • 1于剑.论模糊C均值算法的模糊指标[J].计算机学报,2003,26(8):968-973. 被引量：96
  • 2Raymond T.Ng,Jiawei Han.Efficient and Effective clustering methods for spatial data mining[J].Proceeding of the 20th VLDB Conference Santiago,Chile,1994.
  • 3Ordonez C,Orniecinski E FREM:Fast and Robust EM Clustering for Large Data Sets[J].In:Kalpakis K,Goharian N,Grossman D,eds.Proc.of the 2002 ACM CU《M Int.Conf.on Information and Knowledge Management.McLean:ACM Press,002.590-599.http://citeseer.ist.pstL edu/536 108.html.
  • 4Karypis G.,Han E-H.,Kumar V.CHAMELEON:A hierarchical clustering algorithm using dynamic modeling[J].COMPUTER,1999a,32:68-75.
  • 5Zhang T.,Ramakrishnan R,Livny M.BIRCH:A new data clustering algorithm and its applications[J].Journal of Data Mining and Knowledge Discovery,1997,2:141-182.
  • 6Boley D.L.Principal Direction Divisive Partitioning[J].Data Mining and Knowledge Discovery,1998,2(4):325-344.
  • 7Sheikholeslami G.,Chatterjee S.,Zhang A.WaveCluster:A multi-resolution clustering approach for very large spatial databases[J].In Proceedings of the 24th Conference on VLDB,1998,428-439,New York,NY,.
  • 8Wang W.,Yang J.,Muntz R STING:A statistical information grid approach to spatial data mining[J].In Proceedings of the 23rd Conference on VLDB,186-195,Athens,Greece,1997.
  • 9Rakesh A,Johanners G,Dimitrios G,Prabhakar R Automatic subspace clustering of high dimensional data for data mining applications[J].In:Snodgrass RT,Winslett M,eds.Proc.of the 1994 ACM SIGMOD Int.Conf.on Management of Data.Minneapolis:ACM Press,1994.94-105.
  • 10马帅,王腾蛟,唐世渭,杨冬青,高军.一种基于参考点和密度的快速聚类算法[J].软件学报,2003,14(6):1089-1095. 被引量：108

二级参考文献26

  • 1Han JW, Kambr M. Data Mining Concepts and Techniques. Beijing: Higher Education Press, 2001. 145-176.
  • 2Kaufan L, Rousseeuw PJ. Finding Groups in Data: an Introduction to Cluster Analysis. New York: John Wiley & Sons, 1990.
  • 3Ester M, Kriegel HP, Sander J, Xu X. A density based algorithm for discovering clusters in large spatial databases with noise. In:Simoudis E, Han JW, Fayyad UM, eds. Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining.Portland: AAAI Press, 1996. 226-231.
  • 4Guha S, Rastogi R, Shim K. CURE: an efficient clustering algorithm for large databases. In: Haas LM, Tiwary A, eds. Proceedings of the ACM SIGMOD International Conference on Management of Data. Seattle: ACM Press, 1998. "73-84.
  • 5Agrawal R, Gehrke J, Gunopolos D, Raghavan P. Automatic subspace clustering of high dimensional data for data mining application. In: Haas LM, Tiwary A, eds. Proceedings of the ACM SIGMOD International Conference on Management of Data.Seattle: ACM Press, 1998.94-105.
  • 6Alexandros N, Yannis T,Yannis M. C^2P: clustering based on closest pairs. In: Apers PMG, Atzeni P, Ceri S, Paraboschi S,Ramamohanarao K, Snodgrass RT, eds. Proceedings of the 27th International Conference on Very Large Data Bases. Roma:Morgan Kaufmann Publishers, 2001. 331-340.
  • 7Berchtold S, Bohm C, Kriegel H-P. The pyramid-technique: towards breaking the curse of dimensionality. In: Haas LM, Tiwary A,eds. Proceedings of the ACM SIGMOD International Conference on Management of Data. Seattle: ACM Press, 1998. 142- 153.
  • 8Yu C, Ooi BC, Tan K-L, Jagadish HV. Indexing the distance: an efficient method to KNN processing. In: Apers PMG, Atzeni P,Ceri S, Paraboschi S, Ramamohanarao K, Snodgrass RT, eds. Proceedings of the 27th International Conference on Very Large Data Bases. Roma: Morgan Kaufmann Publishers, 2001. 421--430.
  • 9Bezdek J C. Pattern Recognition with Fuzzy Objective Function Algorithms. New York:Plenum Press, 1981.
  • 10Pal N R, Bezdek J C. On cluster validity for the fuzzy c-mean model. IEEE Transactions on Fuzzy Systems, 1995,3 (3): 370-379.

共引文献202

同被引文献5

引证文献1

二级引证文献4

皖西学院学报
2009年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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