Notice bibliographique
Résumé
Ice lead analysis is an essential task for evaluating climate change processes in the Arctic. Ice leads are narrow cracks in the sea-ice, which build a complex network. While detecting and modeling ice leads has been performed in numerous ways based on airborne images, the dynamics of ice leads over time remain hidden and largely unexplored. These dynamics could be analyzed by interpreting the ice leads as more than just airborne images, but as what they really are: a dynamic network. The lead’s start, end, and intersection points can be considered nodes, and the leads themselves as edges of a network. As the nodes and edges change over time, the ice lead network is constantly evolving. This new network perspective on ice leads could be of great interest for the cryospheric science community since it opens the door to new methods. For example, adapting common link prediction methods might make data-driven ice lead forecasting and tracking feasible. To reveal the hidden dynamics of ice leads, we performed a spatio-temporal and network analysis of ice lead networks. The networks used and presented here are based on daily ice lead observations from Moderate Resolution Imaging Spectroradiometer (MODIS) between 2002 and 2020 by Hoffman et al. [1]. The spatio-temporal analysis of the ice leads exhibits seasonal, annual, and overall trends in the ice lead dynamics. We found that the number of ice leads is decreasing, and the number of width and length outliers is increasing overall. The network analysis of the ice lead graphs reveals unique network characteristics that diverge from those present in common real-world networks. Most notably, current network science methods (1) exploit the information that is embedded into the connections of the network, e.g., in connection clusters, while (2) nodes remain relatively fixed over time. Ice lead networks, however, (1) embed their relevant information spatially, e.g., in spatial clusters, and (2) shift and change drastically. These differences require improvements and modifications on common graph classification and link prediction methods such as Preferential Attachment and EvolveGCN on the domain of ice lead dynamic networks. This work is a call for extending existing network analysis toolkits to include a new class of real-world dynamic networks. Utilizing network science techniques will hopefully further our understanding of ice leads and thus of Arctic processes that are key to climate change mitigation and adaptation. Acknowledgments We would like to thank Prof. Gunnar Spreen, who provided us insights into ice lead detection and possible challenges connected to the project idea. Furthermore, we would like to thank Shenyang Huang and Asst. Prof. David Rolnick for their valuable feedback and support. J.K. was supported in part by the DeepMind scholarship, the Mitacs Globalink Graduate Fellowship, and the German Academic Scholarship Foundation. References [1] Jay P Hoffman, Steven A Ackerman, Yinghui Liu, and Jeffrey R Key. 2019. The detection and characterization of Arctic sea ice leads with satellite imagers. Remote Sensing 11, 5 (2019), 521.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,001 | 0,005 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,001 |
| Bibliométrie | 0,005 | 0,004 |
| Études des sciences et des technologies | 0,001 | 0,000 |
| Communication savante | 0,002 | 0,002 |
| Science ouverte | 0,001 | 0,001 |
| Intégrité de la recherche | 0,001 | 0,001 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,024 | 0,005 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».