Skip to content
AI News HubLIVE
Original source2 min read

Confidence-Based Materials Data Quality Assessment via Domain Knowledge and Graph-Structured Learning

Summary

This paper proposes a confidence-based framework for materials data quality assessment that integrates domain knowledge with graph-structured learning, formulating quality as continuous confidence estimation and demonstrating significant improvements in model performance through rule calibration and graph refinement on multiple benchmarks.

SourcearXiv Machine LearningAuthor: Sihan Liaing, Ji Zhang, Kehan Wang, Zihao Gao, Wei Ma, Yangang Wang, Zongguo Wang
Confidence-Based Materials Data Quality Assessment via Domain Knowledge and Graph-Structured Learning
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 17 Nov 2026]

Title:Confidence-Based Materials Data Quality Assessment via Domain Knowledge and Graph-Structured Learning

View a PDF of the paper titled Confidence-Based Materials Data Quality Assessment via Domain Knowledge and Graph-Structured Learning, by Sihan Liaing and 6 other authors

View PDF HTML (experimental)

Abstract:The rapid development of materials machine learning relies on large-scale, heterogeneous datasets, yet model reliability is often compromised by imperfect data from diverse experiments, simulations, and database integration. Real-world materials databases may contain measurement errors, failed calculations, missing or duplicate records, and hidden violations of physicochemical constraints. Such problems are difficult to identify because corrupted samples may remain statistically plausible rather than appearing as explicit outliers. In this paper, we propose a confidence-based materials data quality assessment framework that integrates domain knowledge with graph-structured learning. Data quality is formulated as a continuous confidence estimation problem rather than a binary anomaly identification task, enabling sample-level assessment and historical-reference-based batch comparison. A nine-dimensional feature-quality prior and duplicate-aware sample initialization are calibrated using materials domain rules and statistical evidence. Confidence is further refined through sample-feature bipartite graph propagation and weakly supervised graph attention, while a Memory-GAT module provides historical reference scoring. Experiments on 23 ODDS benchmark datasets show that the generic module achieves an average AUC-ROC of 0.866. In five repeated mixed-contamination experiments on mp\_20, rule calibration improves HistGradientBoostingRegressor test $R^2$ from $0.538\pm0.008$ to $0.616\pm0.014$. Graph refinement increases average precision from $0.943\pm0.004$ to 0.953\pm0.004$, while the rule-calibrated configuration has the highest mean test $R^2$ among the evaluated screening configurations. Five repeated MACE subset experiments further show an increase in $R^2$ from $0.590\pm0.053$ to $0.880\pm0.027$ after rule-based screening.

Subjects:

Machine Learning (cs.LG); Materials Science (cond-mat.mtrl-sci); Artificial Intelligence (cs.AI)

Cite as: arXiv:2611.23342 [cs.LG]

(or arXiv:2611.23342v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2611.23342

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Zongguo Wang [view email] [v1] Tue, 17 Nov 2026 08:06:38 UTC (6,626 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Confidence-Based Materials Data Quality Assessment via Domain Knowledge and Graph-Structured Learning, by Sihan Liaing and 6 other authors

View PDF

HTML (experimental)

TeX Source

view license

Additional Features

Audio Summary

Current browse context:

cs.LG

new | recent | 2026-11

Change to browse by:

cond-mat cond-mat.mtrl-sci cs cs.AI

References & Citations

SciX

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

ResearchersAdvanced

Key points

  • Data quality is formulated as continuous confidence estimation rather than binary anomaly detection, enabling sample-level assessment and historical-reference-based batch comparison.
  • A nine-dimensional feature-quality prior and duplicate-aware sample initialization are calibrated using materials domain rules and statistical evidence.
  • Confidence is refined through sample-feature bipartite graph propagation and weakly supervised graph attention, with a Memory-GAT module for historical reference scoring.
  • Experiments show average AUC-ROC of 0.866 on 23 ODDS datasets, rule calibration improves R² from 0.538 to 0.616 on mp_20, graph refinement increases average precision from 0.943 to 0.953, and MACE subset experiments show R² increase from 0.590 to 0.880 after rule-based screening.

Highlights and analysis are generated automatically and may contain errors. Check the original source.