Saved in:
| Hovedforfatter: | |
|---|---|
| Format: | Recurso digital |
| Sprog: | |
| Udgivet: |
Zenodo
2025
|
| Online adgang: | https://doi.org/10.5281/zenodo.17595573 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|
Indholdsfortegnelse:
- <p><span>With the rapid development of artificial intelligence, big data, and distributed systems, data has become a core resource for modern intelligent decision-making. However, during the collection, transmission, processing, and utilization of data, it may be affected by problems such as tampering, forgery, omission, or invalidity, which directly impacts the accuracy and reliability of decision-making results. Therefore, data provenance and trustworthiness have become a key research focus. Traditional optimization algorithms, when solving complex optimization problems, often rely on the numerical information of the objective function while ignoring the source and trustworthiness of the data. This can lead to low-quality data interfering with the search process and reducing the reliability of the optimization results.</span></p> <p> </p> <p><span>This paper proposes a novel Data Provenance-Driven Heuristic Optimization (DPDHO) algorithm. This algorithm combines data trustworthiness assessment, heuristic weighting of traceability information, and a dynamic feedback control mechanism to comprehensively consider the source and trustworthiness of data throughout the entire process of candidate solution selection, search, and iterative update. This paper details the algorithm's mathematical modeling, trustworthiness feedback loop mechanism, traceability constraint search mechanism, and weighted objective function design, and provides candidate solution update formulas and iterative processes. This algorithm features adaptive shrinkage of the search space, historical source tracing incentives, and dynamic decay of data timeliness, providing a theoretical foundation and methodological guidance for optimization problems driven by highly reliable data.</span></p>