障碍聚类与离群点检测

ACM SE '10 Pub Date : 2010-04-15 DOI:10.1145/1900008.1900126
Yong Shi
{"title":"障碍聚类与离群点检测","authors":"Yong Shi","doi":"10.1145/1900008.1900126","DOIUrl":null,"url":null,"abstract":"In this paper, we present our research on data mining approaches in the presence of obstacles. Many algorithms have been designed to detect clusters with obstacles in spatial databases. However, few considered to detect clusters and outliers simultaneously and interactively. Here we extend our original research on iterative cluster and outlier detection to study the problem of detecting cluster and outliers iteratively with the presence of obstacles. In many situations, clusters and outliers are concepts whose meanings are inseparable to each other, especially for those data sets with noise. Thus, it is necessary to treat clusters and outliers as concepts of the same importance in data analysis. In this algorithm, clusters are detected and adjusted according to the intra-relationship within clusters and the inter-relationship between clusters and outliers, and vice versa. The adjustment and modification of the clusters and outliers are performed iteratively until a certain termination condition is reached. This data processing algorithm can be applied in many fields such as pattern recognition, data clustering and signal processing.","PeriodicalId":333104,"journal":{"name":"ACM SE '10","volume":"49 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Obstacle clustering and outlier detection\",\"authors\":\"Yong Shi\",\"doi\":\"10.1145/1900008.1900126\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present our research on data mining approaches in the presence of obstacles. Many algorithms have been designed to detect clusters with obstacles in spatial databases. However, few considered to detect clusters and outliers simultaneously and interactively. Here we extend our original research on iterative cluster and outlier detection to study the problem of detecting cluster and outliers iteratively with the presence of obstacles. In many situations, clusters and outliers are concepts whose meanings are inseparable to each other, especially for those data sets with noise. Thus, it is necessary to treat clusters and outliers as concepts of the same importance in data analysis. In this algorithm, clusters are detected and adjusted according to the intra-relationship within clusters and the inter-relationship between clusters and outliers, and vice versa. The adjustment and modification of the clusters and outliers are performed iteratively until a certain termination condition is reached. This data processing algorithm can be applied in many fields such as pattern recognition, data clustering and signal processing.\",\"PeriodicalId\":333104,\"journal\":{\"name\":\"ACM SE '10\",\"volume\":\"49 \",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM SE '10\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1900008.1900126\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SE '10","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1900008.1900126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们介绍了存在障碍的数据挖掘方法的研究。许多算法被设计用来检测空间数据库中有障碍物的聚类。然而,很少有人考虑同时和交互地检测聚类和异常值。在此,我们将原有的迭代聚类和离群点检测的研究扩展到研究存在障碍物时迭代检测聚类和离群点的问题。在许多情况下,聚类和离群值是彼此意义不可分割的概念,特别是对于那些带有噪声的数据集。因此,有必要将聚类和离群值作为数据分析中同等重要的概念来对待。该算法根据聚类内部的相互关系和聚类与离群点之间的相互关系对聚类进行检测和调整,反之亦然。迭代地对聚类和离群点进行调整和修改,直到达到一定的终止条件。该数据处理算法可应用于模式识别、数据聚类和信号处理等多个领域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Obstacle clustering and outlier detection
In this paper, we present our research on data mining approaches in the presence of obstacles. Many algorithms have been designed to detect clusters with obstacles in spatial databases. However, few considered to detect clusters and outliers simultaneously and interactively. Here we extend our original research on iterative cluster and outlier detection to study the problem of detecting cluster and outliers iteratively with the presence of obstacles. In many situations, clusters and outliers are concepts whose meanings are inseparable to each other, especially for those data sets with noise. Thus, it is necessary to treat clusters and outliers as concepts of the same importance in data analysis. In this algorithm, clusters are detected and adjusted according to the intra-relationship within clusters and the inter-relationship between clusters and outliers, and vice versa. The adjustment and modification of the clusters and outliers are performed iteratively until a certain termination condition is reached. This data processing algorithm can be applied in many fields such as pattern recognition, data clustering and signal processing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信