Testing Outlier Detection Algorithms for Identifying Early Stage Solute Clusters in Atom Probe Tomography.

IF 2.9 4区 工程技术 Q3 MATERIALS SCIENCE, MULTIDISCIPLINARY Microscopy and Microanalysis Pub Date : 2024-08-27 DOI:10.1093/mam/ozae076
Ryan S Stroud, Ayham Al-Saffar, Megan Carter, Michael P Moody, Stella Pedrazzini, Mark R Wenman
{"title":"Testing Outlier Detection Algorithms for Identifying Early Stage Solute Clusters in Atom Probe Tomography.","authors":"Ryan S Stroud, Ayham Al-Saffar, Megan Carter, Michael P Moody, Stella Pedrazzini, Mark R Wenman","doi":"10.1093/mam/ozae076","DOIUrl":null,"url":null,"abstract":"<p><p>Atom probe tomography (APT) is commonly used to study solute clustering and precipitation in materials. However, standard techniques used to identify and characterize clusters within atom probe data, such as the density-based spatial clustering applications with noise (DBSCAN), often underperform with respect to small clusters. This is a limitation of density-based cluster identification algorithms, due to their dependence on the parameter Nmin, an arbitrary lower limit placed on detectable cluster sizes. Therefore, this article attempts to consider the characterization of clustering in atom probe data as an outlier detection problem of which k-nearest neighbors local outlier factor and learnable unified neighborhood-based anomaly ranking algorithms were tested against a simulated dataset and compared to the standard method. The decision score output of the algorithms was then auto thresholded by the Karcher mean to remove human bias. Each of the major models tested outperforms DBSCAN for cluster sizes of <25 atoms but underperforms for sizes >30 atoms using simulated data. However, the new combined k-nearest neighbors (k-NN) and DBSCAN method presented was able to perform well at all cluster sizes. The combined k-NN and seven methods are presented as a new approach to identifying clusters in APT.</p>","PeriodicalId":18625,"journal":{"name":"Microscopy and Microanalysis","volume":null,"pages":null},"PeriodicalIF":2.9000,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Microscopy and Microanalysis","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1093/mam/ozae076","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATERIALS SCIENCE, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Atom probe tomography (APT) is commonly used to study solute clustering and precipitation in materials. However, standard techniques used to identify and characterize clusters within atom probe data, such as the density-based spatial clustering applications with noise (DBSCAN), often underperform with respect to small clusters. This is a limitation of density-based cluster identification algorithms, due to their dependence on the parameter Nmin, an arbitrary lower limit placed on detectable cluster sizes. Therefore, this article attempts to consider the characterization of clustering in atom probe data as an outlier detection problem of which k-nearest neighbors local outlier factor and learnable unified neighborhood-based anomaly ranking algorithms were tested against a simulated dataset and compared to the standard method. The decision score output of the algorithms was then auto thresholded by the Karcher mean to remove human bias. Each of the major models tested outperforms DBSCAN for cluster sizes of <25 atoms but underperforms for sizes >30 atoms using simulated data. However, the new combined k-nearest neighbors (k-NN) and DBSCAN method presented was able to perform well at all cluster sizes. The combined k-NN and seven methods are presented as a new approach to identifying clusters in APT.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
测试在原子探针断层扫描中识别早期溶质团的离群值检测算法。
原子探针层析成像(APT)通常用于研究材料中的溶质聚类和沉淀。然而,用于识别和描述原子探针数据中的聚类的标准技术,如基于密度的空间聚类噪声应用(DBSCAN),往往在小聚类方面表现不佳。这是基于密度的聚类识别算法的局限性,因为它们依赖于参数 Nmin,而 Nmin 是对可探测聚类大小的任意下限。因此,本文尝试将原子探针数据中的聚类特征描述视为离群点检测问题,通过模拟数据集测试了 k 近邻局部离群点因子和基于可学习统一邻域的异常排序算法,并将其与标准方法进行了比较。然后,算法输出的判定分数通过 Karcher 平均值自动阈值化,以消除人为偏差。在使用模拟数据对 30 个原子的聚类大小进行测试时,每个主要模型的性能都优于 DBSCAN。不过,新提出的 k-近邻(k-NN)和 DBSCAN 组合方法在所有聚类规模下都表现出色。本文提出的 k-NN 和七种组合方法是在 APT 中识别聚类的一种新方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Microscopy and Microanalysis
Microscopy and Microanalysis 工程技术-材料科学:综合
CiteScore
1.10
自引率
10.70%
发文量
1391
审稿时长
6 months
期刊介绍: Microscopy and Microanalysis publishes original research papers in the fields of microscopy, imaging, and compositional analysis. This distinguished international forum is intended for microscopists in both biology and materials science. The journal provides significant articles that describe new and existing techniques and instrumentation, as well as the applications of these to the imaging and analysis of microstructure. Microscopy and Microanalysis also includes review articles, letters to the editor, and book reviews.
期刊最新文献
Operando Freezing Cryogenic Electron Microscopy of Active Battery Materials. Large-Angle Rocking Beam Electron Diffraction of Large Unit Cell Crystals Using Direct Electron Detector. Obtaining 3D Atomic Reconstructions from Electron Microscopy Images Using a Bayesian Genetic Algorithm: Possibilities, Insights, and Limitations. Utilization of Advanced Microscopy Techniques and Energy-dispersive X-ray Spectroscopy to Characterize Three Piper Species Related to Kava. Imaging and Segmenting Grains and Subgrains Using Backscattered Electron Techniques.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1