Discussion On Density-Based Clustering Methods Applied for Automated Identification of Airspace Flows

Christian Verdonk Gallego, V. G. Gómez Comendador, F. S. Sáez Nieto, Miguel Garcia Martinez
{"title":"Discussion On Density-Based Clustering Methods Applied for Automated Identification of Airspace Flows","authors":"Christian Verdonk Gallego, V. G. Gómez Comendador, F. S. Sáez Nieto, Miguel Garcia Martinez","doi":"10.1109/DASC.2018.8569219","DOIUrl":null,"url":null,"abstract":"Air Traffic Management systems generate a huge amount of track data daily. Flight trajectories can be clustered to extract main air traffic flows by means of unsupervised machine learning techniques. A well-known methodology for unsupervised extraction of air traffic flows conducts a two-step process. The first step reduces the dimensionality of the track data, whereas the second step clusters the data based on a density-based algorithm, DBSCAN. This paper explores advancements in density-based clustering such as OPTICS or HDBSCAN*. This assessment is based on quantitative and qualitative evaluations of the clustering solutions offered by these algorithms. In addition, the paper proposes a hierarchical clustering algorithm for handling noise in this methodology. This algorithm is based on a recursive application of DBSCAN* (RDBSCAN*). The paper demonstrates the sensitivity of these algorithms to different hyper-parameters, recommending a specific setting for the main one, which is common for all methods. RDBSCAN* outperforms the other algorithms in terms of the density-based internal validity metric. Finally, the outcome of the clustering shows that the algorithm extracts main clusters of the dataset effectively, connecting outliers to these main clusters.","PeriodicalId":405724,"journal":{"name":"2018 IEEE/AIAA 37th Digital Avionics Systems Conference (DASC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE/AIAA 37th Digital Avionics Systems Conference (DASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DASC.2018.8569219","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

Air Traffic Management systems generate a huge amount of track data daily. Flight trajectories can be clustered to extract main air traffic flows by means of unsupervised machine learning techniques. A well-known methodology for unsupervised extraction of air traffic flows conducts a two-step process. The first step reduces the dimensionality of the track data, whereas the second step clusters the data based on a density-based algorithm, DBSCAN. This paper explores advancements in density-based clustering such as OPTICS or HDBSCAN*. This assessment is based on quantitative and qualitative evaluations of the clustering solutions offered by these algorithms. In addition, the paper proposes a hierarchical clustering algorithm for handling noise in this methodology. This algorithm is based on a recursive application of DBSCAN* (RDBSCAN*). The paper demonstrates the sensitivity of these algorithms to different hyper-parameters, recommending a specific setting for the main one, which is common for all methods. RDBSCAN* outperforms the other algorithms in terms of the density-based internal validity metric. Finally, the outcome of the clustering shows that the algorithm extracts main clusters of the dataset effectively, connecting outliers to these main clusters.
基于密度的聚类方法在空域流量自动识别中的应用探讨
空中交通管理系统每天都会产生大量的轨迹数据。利用无监督机器学习技术可以对飞行轨迹进行聚类,提取主要的空中交通流。一种众所周知的无监督提取空中交通流量的方法分为两步。第一步降低轨道数据的维数,而第二步基于基于密度的算法DBSCAN对数据进行聚类。本文探讨了基于密度的集群的进展,如OPTICS或HDBSCAN*。这种评估是基于对这些算法提供的聚类解决方案的定量和定性评估。此外,本文还提出了一种分层聚类算法来处理该方法中的噪声。该算法基于DBSCAN* (RDBSCAN*)的递归应用程序。本文论证了这些算法对不同超参数的敏感性,并为所有方法通用的主要参数推荐了一个特定的设置。RDBSCAN*在基于密度的内部有效性度量方面优于其他算法。最后,聚类结果表明,该算法有效地提取了数据集的主要聚类,并将离群点与这些主要聚类联系起来。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信