2023
DOI: 10.1039/d3nr02273k
|View full text |Cite
|
Sign up to set email alerts
|

An explainable machine-learning approach for revealing the complex synthesis path–property relationships of nanomaterials

Kun Jin,
Wentao Wang,
Guangpei Qi
et al.

Abstract: Machine-learning (ML) models have recently shown important advantages in predicting nanomaterial properties, which avoids many trial-and-error explorations. However, complex variables that control the formation of nanomaterials exhibiting desired properties still...

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2024
2024
2025
2025

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 70 publications
(76 reference statements)
0
5
0
Order By: Relevance
“…where Ω (f ) = γT + 1 2 λω 2 The difference between the target y i and the predicted value ŷi is measured by the differentiable convex loss function, denoted by l in this case. The model's complexity is penalized by the second term, Ω.…”
Section: Extreme Gradient Boostmentioning
confidence: 99%
See 4 more Smart Citations
“…where Ω (f ) = γT + 1 2 λω 2 The difference between the target y i and the predicted value ŷi is measured by the differentiable convex loss function, denoted by l in this case. The model's complexity is penalized by the second term, Ω.…”
Section: Extreme Gradient Boostmentioning
confidence: 99%
“…The model's complexity is penalized by the second term, Ω. In order to prevent over-fitting, the extra regularization term smoothens the final learned weights [1,36]. This algorithm, which uses the gradientboosting method, is the creation of a decision-tree-based model with boosting.…”
Section: Extreme Gradient Boostmentioning
confidence: 99%
See 3 more Smart Citations