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

基于定位的数据聚类新算法 被引量：1

下载PDF
导出
摘要 针对现有聚类算法计算复杂度普遍较高的问题,提出了一种基于定位的方法。该算法采用空间定位的方法将数据对象映射到特征空间中,并利用空间立方体的某些特殊顶点定位任一数据点;通过计算数据点与空间立方体顶点群的距离差异,完成聚类过程。在电信数据集上的实验结果表明,算法的时间复杂度降至O(N)级别。
作者 张舒博 牛琨
机构地区 中国电信北京研究院决策研究部 北京邮电大学网络与交换国家重点实验室
出处 《电子技术应用》 北大核心 2007年第4期118-120,123,共4页 Application of Electronic Technique
基金 国家自然科学基金项目(No.60432010)
关键词 数据挖掘 聚类 定位法 空间立方体
分类号 TP391.41 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献9

  • 1GUHA S, RASTOGI R, SHIM K. CURE: An effcient clustering algorithm for large databases. In: Haas LM,Tiwary A, eds. Proc. of the ACM SIGMOD Int'l Conf.on Management of Data. Seattle: ACM Press, 1998:73-84http://citeseer.ist.psu.edu/guha98cure.html
  • 2ZHANG T, RAMAKRISHNAN R, LIVNY M. BIRCH: An efficient data clustering method for very large databases.In: Jagadish HV, Mumick IS, eds. Proc. of the 1996 ACM SIGMOD Int'l Conf. on Management of Data. Montreal: ACM Press, 1996:103-114.
  • 3MCQUEEN J. Some methods for classfication and Analysis of Multivariate Observations. In: LeCam, L., Neyman, J.,eds.Proceddings of the 5^th Berkeley Symposium on Mathematical Statistics and Probability, 1967:281-297.
  • 4ANKERST M, BREUNIG M M, KRIEGEL H P, et al.OPTICS: Ordering points to identify the clustering structure In: Delis A, Faloutsos C, Ghandeharizadeh S, eds. Proc.ACM SIGMOD Int'l Conf. on Management of Data.Philadelphia; ACM Press, 1999:49-60.
  • 5ESTER M, KRIEGEL H P, SANDER J,et al. A density-based algorithm for discovering clusters in large spatial databases with noises. Proceedings of the 2^th International Conference on Knowledge Discovery and Data Mining(KDD'96), AAAI Press,1996:226-231.
  • 6WANG W, YANG J, MUNTZ R R. STING: A statistical information grid approach to spatial data mining. Proc. of the 23rd Int'l Conf. on Very Large Data Bases. Athens:Morgan Kaufmann, 1997:186-195.
  • 7Integral Solutions Limited. ISL clementine user guide and reference manual, 1994.
  • 8DASH M, LIU H. Feather selection for clustering. In Pacific-Asia Conference on Knowledge Discouvery and Data Mining, 2000:110-121.
  • 9钱卫宁,周傲英.从多角度分析现有聚类算法(英文)[J].软件学报,2002,13(8):1382-1394. 被引量：86

二级参考文献36

  • 1[1]Fasulo, D. An analysis of recent work on clustering algorithms. Technical Report, Department of Computer Science and Engineering, University of Washington, 1999. http://www.cs.washington.edu.
  • 2[2]Baraldi, A., Blonda, P. A survey of fuzzy clustering algorithms for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 1999,29:786～801.
  • 3[3]Keim, D.A., Hinneburg, A. Clustering techniques for large data sets - from the past to the future. Tutorial Notes for ACM SIGKDD 1999 International Conference on Knowledge Discovery and Data Mining. San Diego, CA, ACM, 1999. 141～181.
  • 4[4]McQueen, J. Some methods for classification and Analysis of Multivariate Observations. In: LeCam, L., Neyman, J., eds. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability. 1967. 281～297.
  • 5[5]Zhang, T., Ramakrishnan, R., Livny, M. BIRCH: an efficient data clustering method for very large databases. In: Jagadish, H.V., Mumick, I.S., eds. Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data. Quebec: ACM Press, 1996. 103～114.
  • 6[6]Guha, S., Rastogi, R., Shim, K. CURE: an efficient clustering algorithm for large databases. In: Haas, L.M., Tiwary, A., eds. Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data. Seattle: ACM Press, 1998. 73～84.
  • 7[7]Beyer, K.S., Goldstein, J., Ramakrishnan, R., et al. When is 'nearest neighbor' meaningful? In: Beeri, C., Buneman, P., eds. Proceedings of the 7th International Conference on Data Theory, ICDT'99. LNCS1540, Jerusalem, Israel: Springer, 1999. 217～235.
  • 8[8]Ester, M., Kriegel, H.-P., Sander, J., et al. A density-based algorithm for discovering clusters in large spatial databases with noises. In: Simoudis, E., Han, J., Fayyad, U.M., eds. Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD'96). AAAI Press, 1996. 226～231.
  • 9[9]Ester, M., Kriegel, H.-P., Sander, J., et al. Incremental clustering for mining in a data warehousing environment. In: Gupta, A., Shmueli, O., Widom, J., eds. Proceedings of the 24th International Conference on Very Large Data Bases. New York: Morgan Kaufmann, 1998. 323～333.
  • 10[10]Sander, J., Ester, M., Kriegel, H.-P., et al. Density-Based clustering in spatial databases: the algorithm GDBSCAN and its applications. Data Mining and Knowledge Discovery, 1998,2(2):169～194.

共引文献85

同被引文献2

引证文献1

二级引证文献2

电子技术应用
2007年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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