期刊文献+

一种基于角度的边界点检测算法 被引量:2

Boundary Points Detect Algorithm Based on Angle
下载PDF
导出
摘要 针对目前数据挖掘中边界点检测效率低、参数阈值范围不容易确定的问题,提出一种新的边界点检测算法BORAL。该算法基于一个有取值范围的参数阈值,利用在边界点的半径ε邻域中边界点与其他点组成的向量夹角中较大的夹角检测边界点,且该夹角邻域内不含有其他点的特征。实验结果表明BORAL能有效检测出边界点、执行效率高,当角度阈值从40°变到57°时,聚类的边界变化不大。 This paper addresses a new boundary detection algorithm called BORAL (Boundary Points Detector Based on Angle), according to the problem of low efficient boundary detection and that it is uneasy to determine the scope of the parameter pruning in data mining. The algorithm based on the parameter pruning with range uses the feature to detect boundary points, such as a bigger angle area of the vectors made of the boundary point with the other points, and the angle area no longer contains any point in ε neighborhood. Experimental results indicate that BORAL detects boundary points effectively and has higher efficiency. The change scope of the border clustering is not large, when angle pruning changes from 40° to 57°.
出处 《计算机工程》 CAS CSCD 北大核心 2008年第11期203-205,共3页 Computer Engineering
基金 国家自然科学基金资助项目“多语言多媒体网络教学系统的新技术新方法研究”(60363004)
关键词 数据挖掘 边界点 邻域 角度 data mining boundary points neighborhood angle
  • 相关文献

参考文献8

  • 1Ester M, Kriegel H P, Sander J. A Density-based Algorithm for Discovering Cluster in Large Spatial Databases with Noise[C]// Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining. Porland, Oregon: [s. n.], 1996:226-231.
  • 2Agrawal R, Gehrke J, Gunopulos D, et al. Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications[C]//Proc, of the ACM SIGMOD International Conference on Management of Data. Seattle, Washington, USA: [s. n.], 1998:94-105.
  • 3Sheikholeslami G, Chatterjee S, Zhang Aidong. Wavecluster: A Multi-resolution Clustering Approach for Very Large Spatial Database[C]//Proc. of the 24th Int'l Conf. on Very Large Data Bases. New York, USA: [s. n.], 1998: 428-439.
  • 4Zhao Yanchang, Gdlic J J. A Grid-based Density-isoline Clustering Algorithm[C]//Proc. of 2001 Int'l Conferences on Info-tech and Info-net. Beijing, China: [s. n.], 2001: 140-145.
  • 5刘建晔,李芳.一种基于密度的高性能增量聚类算法[J].计算机工程,2006,32(21):76-78. 被引量:12
  • 6邱保志,沈钧毅.基于网格技术的高精度聚类算法[J].计算机工程,2006,32(3):12-13. 被引量:11
  • 7Xia Chenyi, Wynne H, Lee Mongli, et al. BORDER: Efficient Computation of Boundary Points[J]. IEEE Transactions on Knowledge and Engineering, 2006,18(3): 289-303.
  • 8Korn F, Muthukrishnan S. Influence Sets Based on Reverse Nearest Neighbor Queries[C]//Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. [S.l.]: ACM Press, 2000.

二级参考文献7

  • 1Hinneburg A,Keim D A.Optional Grid-clustering:Towards Breaking the Curse of Dimensionality in High-dimensional Clustering[C].Proc.of the 25th VLDB Conf.,Edinburgh,Scotland,1999:506-517.
  • 2Zhao Yanchang,Song Junde.GDILC:A Gride-based Densith-isoline Clustering Algorithm[C].Proc.of 2001 Int'l Conf.on Info-tech and Info-net,Beijing,China,IEEE 2001:140-145.
  • 3Eden W M,Chow T W S.A New Shifting Grid Clustering Algorithm[J].Pattern Recognition,2003,37(3):503-514.
  • 4Hsu Chihming,Chen Mingsyan.Subspace Clustering of High Dimensional Spatial Data with Noise[C].Advanced in Knowledge Discovery and Data Mining:8th Pacific-Asia Conference,2004:31-40.
  • 5Agrawal R,Gehrke J.Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications[C].Proc.of the ACM SIGMOD Int'l Conference on Management of Data,Seattle,Washington,1998-06:94-105.
  • 6Margaret H D.数据挖掘教程[M].北京:清华大学出版社,2005.
  • 7Han Jiawei.Data Mining:Concepts and Techniques[M].Beijing:Higher Education Press,2001.

共引文献21

同被引文献17

引证文献2

二级引证文献42

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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