Papers › Describe, Transform, Machine Learning: Feature Engineering for Grain Boundaries and...
Describe, Transform, Machine Learning: Feature Engineering for Grain Boundaries and Other Variable-Sized Atom Clusters
C. Braxton Owens, Nithin Mathew, Tyce W. Olaveson, Jacob P. Tavenner, Edward M. Kober, Garritt J. Tucker, Gus L. W. Hart, Eric R. Homer
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Obtaining microscopic structure-property relationships for grain boundaries are challenging because of the complex atomic structures that underlie their behavior. This has led to recent efforts to obtain these relationships with machine learning, but representing a grain boundary structure in a manner suitable for machine learning is not a trivial task. There are three key steps common to property prediction in grain boundaries and other variable-sized atom clustered structures. These are: (1) describe the atomic structure as a feature matrix, (2) transform the variable-sized feature matrices of different structures to a fixed length common to all structures, and (3) apply machine learning to predict properties from the transformed feature matrices. We examine these feature engineering steps to understand how they impact the accuracy of grain boundary energy predictions. A database of over 7000 grain boundaries serves to evaluate the different feature engineering combinations. We also examine how these combination of engineered features provide interpretability, or the ability to extract insightful physics from the obtained structure-property relationships.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections