FRINGE:边界点的有效检测

陈阵; 于炯

您当前的位置：

首页 >

文章列表页 >

FRINGE:边界点的有效检测

研究精粹 | 更新时间：2026-01-21

- FRINGE:边界点的有效检测
- FRINGE:边界点的有效检测
- 新疆大学学报（自然科学版中英文） 2008年111卷第3期页码：263-268
- 作者机构：
  
  1. 新疆大学信息科学与工程学院
  2. 北京理工大学计算机学院
- 作者简介：
- 基金信息：
  
  国家自然科学基金(编号:60563002);教育部春晖计划项目(Z2005-1-65009);新疆自治区高校科研重点项目(XJEDU2004I03)
- DOI：
  中图分类号： TP391.41
- 纸质出版：2008
- 稿件说明：
移动端阅览
[1]陈阵,于炯.FRINGE:边界点的有效检测[J].新疆大学学报(自然科学版),2008,No.111(03):263-268.

陈阵, 于炯. FRINGE:边界点的有效检测[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2008, 111(3): 263-268.
[1]陈阵,于炯.FRINGE:边界点的有效检测[J].新疆大学学报(自然科学版),2008,No.111(03):263-268. DOI：

陈阵, 于炯. FRINGE:边界点的有效检测[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2008, 111(3): 263-268. DOI：

摘要

本文阐述了在数据集中找边界点的问题

边界点是分布在稠密数据集边缘的数据点.本文描述了一种称作FRINGE的新方法来检测边界点.FRINGE(an eFficient boundaRy poInts detectioN based on Grid and anglE)利用了网格技术和角度的特点

利用了具有多种特性的数据进行实验

实验结果表明FRINGE能在含有噪声点/孤立点的不同形状、大小的数据集上有效地检测出边界点

并且执行效率更高.

Abstract

This work addresses the problem of detecting boundary points in data sets. Boundary points are data points that distribute the edge of densely distributed data such as the cluster. It describes a novel approach called FRINGE (an eFficient boundaRy poInts detectioN based on Grid and anglE) to detect boundary points. FRINGE employs the grid technique and the angle feature. Experimental studies on data sets with varying characteristics indicate that FRINGE is able to detect boundary points in the noisy dataset containing different shapes and sizes clusters effectively and has higher efficiency.

关键词

Keywords

references

Martin Ester,Hans-Peter Kriegel,Jorg Sander.A Density-Based Algorithm for Discovering Cluster in Large Spatial Databases with Noise[C].Proceedings of2nd International Conference on Knowledge Discovery and Data Ming(KDD-96).Porland.Oregon,1996,226-231.

Rakesh Agrawal,Johannes Gehrke,Dimitrios Gunopulos,et al.Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications[C].Proceedings of the ACM SIGMOD International Conference on Management of Data.Seattle.Washington,1998,94-105.

GUHA S,RASTOGI R,SHIM K CURE.An Efficient Clustering Algorithm for Large Database[J].New York:ACM Press,1998,35:73-84.

Sheikholeslami G,Chatterjee S,Zhang AD.WaveCluster.A multi-resolution clustering approach for very large spatial database[C].Proc Of the24th Int l Conf on Very Large Data Bases.New York:Morgan Kaufmann,1998,428-439.

Mehta M,Agrawal R,Rissanen J.SLIQ:A Fast and Scalable Classifier for Data Mining[J].IBM Almaden Research Center,1996,86(11):90-102.

Chenyi Xia,Wynne Hsu,Mong Li Lee et al.BORDER:Efficient Computation of Boundary Points[J].IEEE transaction on knowledge and engineering,2006,18(3):289-303.

Kom F,Muthukrishnan S.Influence Sets Based on Reverse Nearest Neighbor Queries[C].In:Naughton JF,Bernstein PA eds Proc of the2000ACM SIGMOD Int’l Conf Management of Data,Acm Press,2000,201-212.

Xia C,Lu H,Ooi B C,et al.Gorder:An Efficient Method for KNN Join Processing[C].The30th VLDB Conference,Torcnto,canoda,2004.

邱保志,沈均毅.基于网格技术的高精度聚类算法[J].计算机工程,2006,32(3):12-13.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

暂无数据